Not Enough Points Is Enough

DOI10.1007/978-3-540-74915-8_24zbMATH Open1179.03021OpenAlexW1498388520MaRDI QIDQ3608420FDOQ3608420

Authors: Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto 

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_24

Recommendations

• A General Class of Models of $\mathcal{H}^*$
• Models of the lambda calculus
• Categorical models for non-extensional λ-calculi and combinatory logic
• scientific article; zbMATH DE number 3889501
• scientific article; zbMATH DE number 4103048

zbMATH Keywords

Cartesian closed categoriesnon-determinism\(\lambda \)-calculusrelational model\(\lambda \)-models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Cited In (30)

• Execution time of λ-terms via denotational semantics and intersection types
• Title not available (Why is that?)
• Fully abstract submodels of typed lambda calculi
• A relational semantics for parallelism and non-determinism in a functional setting
• Inhabitation for non-idempotent intersection types
• The Scott model of linear logic is the extensional collapse of its relational model
• A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
• Essential and relational models
• Differential Linear Logic and Polarization
• Relational graph models, Taylor expansion and extensionality
• Strong normalization through intersection types and memory
• Categorical models for simply typed resource calculi
• Interpreting a finitary pi-calculus in differential interaction nets
• Title not available (Why is that?)
• Graph easy sets of mute lambda terms
• Amb Breaks Well-Pointedness, Ground Amb Doesn't
• Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
• From semantics to types: the case of the imperative \(\lambda\)-calculus
• Title not available (Why is that?)
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Models of the lambda calculus
• A category theoretic formulation for Engeler-style models of the untyped \(\lambda\)-calculus
• Transport of finiteness structures and applications
• A Relational Model of a Parallel and Non-deterministic λ-Calculus
• What is a categorical model of the differential and the resource \(\lambda \)-calculi?
• A General Class of Models of $\mathcal{H}^*$
• Relational graph models at work
• From semantics to types: the case of the imperative \(\lambda\)-calculus
• Interpreting Localized Computational Effects Using Operators of Higher Type
• Graph lambda theories

This page was built for publication: Not Enough Points Is Enough

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