Sciweavers

3583 search results - page 20 / 717
» A Type System for the Relational Calculus of Object Systems
Sort
View
IFIP
2004
Springer
14 years 28 days ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 3 months ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
LPAR
2005
Springer
14 years 1 months ago
Strong Normalization of the Dual Classical Sequent Calculus
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
APAL
2008
79views more  APAL 2008»
13 years 7 months ago
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
Klaus Aehlig