We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...