Essential and relational models

DOI10.1017/S0960129515000316MaRDI QIDQ5269000zbMATH OpenWikidataFDO

Authors Luca Paolini, Mauro Piccolo, Simona Ronchi Della Rocca

Publication date 14 June 2017

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0960129515000316

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categories of spans/cospans, relations, or partial maps (18B10) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Logical semantics for stability
• scientific article; zbMATH DE number 1354138
• Strict intersection types for the lambda calculus
• Intersection types and lambda models
• Intersection type assignment systems

Cites work

• A General Class of Models of $\mathcal{H}^*$
• A linearization of the Lambda-calculus and consequences
• A type assignment system for game semantics
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Bounding normalization time through intersection types
• Collapsing non-idempotent intersection types
• Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
• Domain theory in logical form
• Exponentials with infinite multiplicities
• Filter models: non-idempotent intersection types, orthogonality and polymorphism
• Functional Characters of Solvable Terms
• scientific article; zbMATH DE number 3889502 (Why is no real title available?)
• scientific article; zbMATH DE number 49833 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• Lambda‐Calculus Models and Extensionality
• Logical semantics for stability
• Models of the lambda calculus
• Not Enough Points Is Enough
• Principality and type inference for intersection types using expansion variables
• Solvability in resource lambda-calculus
• The emptiness problem for intersection types
• The Inhabitation Problem for Non-idempotent Intersection Types
• The lambda calculus is algebraic
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The parametric lambda calculus. A metamodel for computation.
• Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
• What is a categorical model of the differential and the resource \(\lambda \)-calculi?

Cited in

(17)

• A type assignment for -calculus complete both for FPTIME and strong normalization
• Logical semantics for stability
• Inhabitation for non-idempotent intersection types
• Relational graph models at work
• Towards a semantic measure of the execution time in call-by-value lambda-calculus
• Tight typings and split bounds, fully developed
• scientific article; zbMATH DE number 5593358 (Why is no real title available?)
• Solvability = typability + inhabitation
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)
• A deep quantitative type system
• Solvability in a probabilistic setting (invited talk)
• Intersection types and denotational semantics: an extended abstract (invited paper)
• Semantic bounds and multi types, revisited
• Extensional and non-extensional functions as processes
• Strong normalization through idempotent intersection types: a new syntactical approach
• Lambda galore
• Interaction improvement

This page was built for publication: Essential and relational models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269000)