21 search results - page 3 / 5 » A Dependent Type Theory with Names and Binding |
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
ENTCS
2007
13 years 5 months ago
2007
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
LICS
2009
IEEE
13 years 12 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
ICFP
2003
ACM
14 years 5 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
ITP
2010
13 years 9 months ago
2010
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...