Sciweavers

25 search results - page 2 / 5
» Induction Principles Formalized in the Calculus of Construct...
Sort
View
POPL
2010
ACM
14 years 3 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
SCP
2011
255views Communications» more  SCP 2011»
13 years 1 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
CADE
1994
Springer
13 years 10 months ago
Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...
Lars-Henrik Eriksson
TYPES
2004
Springer
13 years 11 months ago
A Few Constructions on Constructors
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
Conor McBride, Healfdene Goguen, James McKinna
JAR
2007
123views more  JAR 2007»
13 years 6 months ago
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
Alberto Ciaffaglione, Luigi Liquori, Marino Micula...