36 search results - page 3 / 8 » Inductive types in the Calculus of Algebraic Constructions |
TCS
2008
13 years 6 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
SAS
1993
Springer
13 years 10 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
ACL
2001
13 years 7 months ago
2001
We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to t...
TLCA
2007
Springer
14 years 4 days ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
LICS
2008
IEEE
14 years 13 days ago
2008
IEEE
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the a-calculus, a minimal calcu...