DOIAbstract
AbstractWe prove that the equivalence of recursive types induced by the equality of their infinite unfoldings coincides with the equality of their interpretations as closures over the λ-model Pω
AbstractWe prove that the equivalence of recursive types induced by the equality of their infinite unfoldings coincides with the equality of their interpretations as closures over the λ-model Pω
We discuss the mathematical foundations of specifications, theories, and models with higher types. H...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
AbstractWe prove that the equivalence of recursive types induced by the equality of their infinite u...
Studies of equivalence for recursive types often consider impoverished type systems, where the equat...
Studies of equivalence for recursive types often consider impoverished type systems, where the equat...
AbstractIn this paper we study type inference systems for λ-calculus with a recursion operator over ...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regu...
AbstractPω, the powerset of the natural numbers, may be turned into an applicative structure by Myhi...
Contains fulltext : 104054.pdf (preprint version ) (Open Access)1992 Workshop on T...
An algebraic specification is called ω-complete or inductively complete if all (open as well as clos...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The ...
Abstract. We analyze the interpretation of inductive and coinductive types as sets of strongly norma...
We show how codatatypes can be employed to produce compact, high-level proofs of key results in logi...
We discuss the mathematical foundations of specifications, theories, and models with higher types. H...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
AbstractWe prove that the equivalence of recursive types induced by the equality of their infinite u...
Studies of equivalence for recursive types often consider impoverished type systems, where the equat...
Studies of equivalence for recursive types often consider impoverished type systems, where the equat...
AbstractIn this paper we study type inference systems for λ-calculus with a recursion operator over ...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regu...
AbstractPω, the powerset of the natural numbers, may be turned into an applicative structure by Myhi...
Contains fulltext : 104054.pdf (preprint version ) (Open Access)1992 Workshop on T...
An algebraic specification is called ω-complete or inductively complete if all (open as well as clos...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The ...
Abstract. We analyze the interpretation of inductive and coinductive types as sets of strongly norma...
We show how codatatypes can be employed to produce compact, high-level proofs of key results in logi...
We discuss the mathematical foundations of specifications, theories, and models with higher types. H...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
Add to ORKG