Sciweavers

92 search results - page 5 / 19
» The simply typed rewriting calculus
Sort
View
APAL
2008
112views more  APAL 2008»
13 years 7 months ago
A domain model characterising strong normalisation
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
Ulrich Berger
RTA
2005
Springer
14 years 29 days ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
29
Voted
CTCS
1987
Springer
13 years 11 months ago
A Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...
Tatsuya Hagino
TPHOL
2007
IEEE
14 years 1 months ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 7 months ago
The Calculus of Algebraic Constructions
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...
Frédéric Blanqui, Jean-Pierre Jouann...