scientific article; zbMATH DE number 6917944
From MaRDI portal
Publication:4580329
DOI10.23638/LMCS-14(3:2)2018zbMath1448.68207arXiv1703.10382MaRDI QIDQ4580329
Giulio Manzonetto, Flavien Breuvart, Domenico Ruoppolo
Publication date: 15 August 2018
Full work available at URL: https://arxiv.org/abs/1703.10382
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Relational graph models, Taylor expansion and extensionality
- A relational semantics for parallelism and non-determinism in a functional setting
- A semantic measure of the execution time in linear logic
- The parametric lambda calculus. A metamodel for computation.
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Parametric \(\lambda \)-theories
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Normal functors, power series and \(\lambda\)-calculus
- Algebras and combinators
- Domain theory in logical form
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Constructive proofs of the range property in lambda calculus
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- The differential lambda-calculus
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- On the characterization of models of H*: The semantical aspect
- What is a categorical model of the differential and the resource λ-calculi?
- Copatterns
- Linearity, Non-determinism and Solvability
- Loader and Urzyczyn Are Logically Related
- A General Class of Models of $\mathcal{H}^*$
- Models of the lambda calculus
- A filter lambda model and the completeness of type assignment
- Call-by-Value Non-determinism in a Linear Logic Type Discipline
- Graph lambda theories
- Some reasons for generalising domain theory
- Exponentials with Infinite Multiplicities
- Not Enough Points Is Enough
- Effective λ-models versus recursively enumerable λ-theories
- Confluence of Pure Differential Nets with Promotion
- Characterization theorems for a filter lambda model
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Data Types as Lattices
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Approximate Reduction and Lambda Calculus Models
- A Filter Model for Concurrent $\lambda$-Calculus
- On the characterization of models of H
- The lambda calculus is algebraic
- The Lattice of Lambda Theories
- Essential and relational models
- Weighted Relational Models of Typed Lambda-Calculi
- Non-determinism, Non-termination and the Strong Normalization of System T
- The Resource Lambda Calculus Is Short-Sighted in Its Relational Model
- Practical coinduction
- New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable.
- A Semantical and Operational Account of Call-by-Value Solvability
- The cartesian closed bicategory of generalised species of structures
- Intensional interpretations of functionals of finite type I
- The Calculi of Lambda Conversion. (AM-6)
- Logical Approaches to Computational Barriers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
