376 search results - page 1 / 76 » Developing Theories of Types and Computability via Realizabi... |
ENTCS
2000
13 years 4 months ago
2000
ESOP
2008
Springer
13 years 6 months ago
2008
Springer
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
ENTCS
2006
13 years 4 months ago
2006
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...