47 search results - page 2 / 10 » Representing Nested Inductive Types Using W-Types |
TLCA
2005
Springer
13 years 11 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
SOSL
1993
13 years 9 months ago
1993
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
ILP
1998
Springer
13 years 9 months ago
1998
Springer
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
APLAS
2007
ACM
13 years 9 months ago
2007
ACM
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...