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
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
AbstractAn interpretation of Abadi and Cardelli's first-order functionobject calculusinto a typedπ-c...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
AbstractA semantic interpretation A for a programming language L is fully abstract if, whenever A〚C[...
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
AbstractWe prove that the problem of deciding for closed terms t1, t2 of the typed λ-calculus whethe...
In any model of typed λ-calculus conianing some basic arithmetic, a functional p - * (procedure—* e...
AbstractType assignment systems for λ-calculus based on intersection types are a general framework f...
AbstractWe consider the lambda calculus obtained from the simply typed calculus by adding products, ...
AbstractType theories in the sense of Martin-Löf and the NuPRL system are based on taking as primiti...
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...
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
AbstractAn interpretation of Abadi and Cardelli's first-order functionobject calculusinto a typedπ-c...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
AbstractA semantic interpretation A for a programming language L is fully abstract if, whenever A〚C[...
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
AbstractWe prove that the problem of deciding for closed terms t1, t2 of the typed λ-calculus whethe...
In any model of typed λ-calculus conianing some basic arithmetic, a functional p - * (procedure—* e...
AbstractType assignment systems for λ-calculus based on intersection types are a general framework f...
AbstractWe consider the lambda calculus obtained from the simply typed calculus by adding products, ...
AbstractType theories in the sense of Martin-Löf and the NuPRL system are based on taking as primiti...
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...
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
AbstractAn interpretation of Abadi and Cardelli's first-order functionobject calculusinto a typedπ-c...
DOI
Add to ORKG