Sciweavers

46 search results - page 7 / 10
» Strong normalization proofs by CPS-translations
Sort
View
CSL
2009
Springer
13 years 11 months ago
Confluence of Pure Differential Nets with Promotion
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...
Paolo Tranquilli
LOGCOM
2002
105views more  LOGCOM 2002»
13 years 7 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
MFCS
2010
Springer
13 years 6 months ago
Harnessing MLF with the Power of System F
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
Giulio Manzonetto, Paolo Tranquilli
LPAR
2010
Springer
13 years 5 months ago
Logic and Computation in a Lambda Calculus with Intersection and Union Types
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
Daniel J. Dougherty, Luigi Liquori
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui