scientific article
From MaRDI portal
Publication:3221961
zbMath0558.03007MaRDI QIDQ3221961
Mario Coppo, Mariangiola Dezani-Ciancaglini, Furio Honsell
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (50)
Proof-functional connectives and realizability ⋮ Easy lambda-terms are not always simple ⋮ Easiness in graph models ⋮ Intersection types and lambda models ⋮ A characterization of F-complete type assignments ⋮ Intersection type assignment systems ⋮ Intersection-types à la Church ⋮ Type theories, normal forms, and \(D_{\infty}\)-lambda-models ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Finitary Semantics of Linear Logic and Higher-Order Model-Checking ⋮ A semantics for type checking ⋮ Intersection and union types ⋮ From semantics to types: the case of the imperative \(\lambda\)-calculus ⋮ The untyped computational \(\lambda \)-calculus and its intersection type discipline ⋮ Domain theory in logical form ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ An irregular filter model ⋮ A type assignment system for game semantics ⋮ Intersection types and domain operators ⋮ Behavioural inverse limit \(\lambda\)-models ⋮ On phase semantics and denotational semantics in multiplicative-additive linear logic ⋮ Filter models with polymorphic types ⋮ Intersection type assignment systems with higher-order algebraic rewriting ⋮ Complete restrictions of the intersection type discipline ⋮ An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus ⋮ Intersection types for combinatory logic ⋮ Types with intersection: An introduction ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ Intersection Types and Computational Rules ⋮ A \(\kappa\)-denotational semantics for map theory in ZFC+SI ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Unnamed Item ⋮ Intersection types for \(\lambda\)-trees ⋮ Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models ⋮ Recursive Domain Equations of Filter Models ⋮ Logical Semantics for Stability ⋮ Unnamed Item ⋮ Infinite \(\lambda\)-calculus and types ⋮ Semantical analysis of perpetual strategies in \(\lambda\)-calculus ⋮ Building continuous webbed models for system F ⋮ Generalized filter models ⋮ Simple Easy Terms ⋮ The Relevance of Semantic Subtyping ⋮ Compositional characterisations of \(\lambda\)-terms using intersection types ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms ⋮ Type inference, abstract interpretation and strictness analysis ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ Essential and relational models ⋮ Full abstraction for lambda calculus with resources and convergence testing
This page was built for publication:
