AbstractA model-theoretic operation is characterized that preserves the property of being a model of typed λ-calculus (i.e., the result of applying it to a model of typed λ-calculus is another model of typed λ-calculus). An expression is well-typed iff the class of its models is closed under this operation
AbstractWe consider several different sound and complete classes of models for the computational ·-c...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
AbstractAbramsky's Linear Chemical Abstract Machine is a term calculus which corresponds to Linear L...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
AbstractWe use a perception of second-order typing in the λ-Calculus, as conveying semantic properti...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
AbstractType assignment systems for λ-calculus based on intersection types are a general framework f...
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
This paper is about a categorical approach to model a very simple Semantically Linear λ-calculus, na...
In any model of typed λ-calculus conianing some basic arithmetic, a functional p - * (procedure—* e...
Type assignment systems for λ-calculus based on intersection types are a general framework for build...
Proof principles for reasoning about various semantics of untyped \u3bb-calculus are discussed. The ...
AbstractRules for assigning type-schemes to untyped λ-terms are given, three different semantics are...
AbstractWe consider several different sound and complete classes of models for the computational ·-c...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
AbstractAbramsky's Linear Chemical Abstract Machine is a term calculus which corresponds to Linear L...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
AbstractWe use a perception of second-order typing in the λ-Calculus, as conveying semantic properti...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
AbstractType assignment systems for λ-calculus based on intersection types are a general framework f...
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
This paper is about a categorical approach to model a very simple Semantically Linear λ-calculus, na...
In any model of typed λ-calculus conianing some basic arithmetic, a functional p - * (procedure—* e...
Type assignment systems for λ-calculus based on intersection types are a general framework for build...
Proof principles for reasoning about various semantics of untyped \u3bb-calculus are discussed. The ...
AbstractRules for assigning type-schemes to untyped λ-terms are given, three different semantics are...
AbstractWe consider several different sound and complete classes of models for the computational ·-c...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
AbstractAbramsky's Linear Chemical Abstract Machine is a term calculus which corresponds to Linear L...
DOI
Add to ORKG