Recommendations
Cites work
- scientific article; zbMATH DE number 2185654 (Why is no real title available?)
- scientific article; zbMATH DE number 5851813 (Why is no real title available?)
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- 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 3523517 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 3611324 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1330448 (Why is no real title available?)
- scientific article; zbMATH DE number 1342276 (Why is no real title available?)
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 7204439 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- A Filter Model for Concurrent \lambda-Calculus
- A General Class of Models of $\mathcal{H}^*$
- A Semantical and Operational Account of Call-by-Value Solvability
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- A category theoretic formulation for Engeler-style models of the untyped -calculus
- A filter lambda model and the completeness of type assignment
- A relational semantics for parallelism and non-determinism in a functional setting
- A semantic measure of the execution time in linear logic
- Algebras and combinators
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Approximate Reduction and Lambda Calculus Models
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Call-by-value non-determinism in a linear logic type discipline
- Characterization theorems for a filter lambda model
- Collapsing non-idempotent intersection types
- Confluence of Pure Differential Nets with Promotion
- Constructive proofs of the range property in lambda calculus
- Copatterns, programming infinite structures by observations
- Data Types as Lattices
- Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
- Domain theory in logical form
- Effective λ-models versus recursively enumerable λ-theories
- Essential and relational models
- Exponentials with infinite multiplicities
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Graph lambda theories
- Intensional interpretations of functionals of finite type I
- Linearity, non-determinism and solvability
- Loader and Urzyczyn are logically related
- Logical Approaches to Computational Barriers
- Models of the lambda calculus
- New results on Morris's observational theory: the benefits of separating the inseparable
- Non-determinism, non-termination and the strong normalization of System T
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- Nonmodularity results for lambda calculus
- Normal functors, power series and -calculus
- Not Enough Points Is Enough
- On the characterization of models of H^: the semantical aspect
- On the characterization of models of \(\mathcal{H}^*\)
- Parametric \(\lambda \)-theories
- Practical coinduction
- Relational graph models, Taylor expansion and extensionality
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Some reasons for generalising domain theory
- The Calculi of Lambda Conversion. (AM-6)
- The Lattice of Lambda Theories
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- The cartesian closed bicategory of generalised species of structures
- The differential lambda-calculus
- The lambda calculus is algebraic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The parametric lambda calculus. A metamodel for computation.
- The resource lambda calculus is short-sighted in its relational model
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Weighted relational models of typed lambda-calculi
- What is a categorical model of the differential and the resource \(\lambda \)-calculi?
Cited in
(7)- Relational graph models, Taylor expansion and extensionality
- New results on Morris's observational theory: the benefits of separating the inseparable
- Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
- On the characterization of models of H^: the semantical aspect
- On the characterization of models of \(\mathcal{H}^*\)
- Semantic bounds and multi types, revisited
- Non-idempotent intersection types in logical form
This page was built for publication: Relational graph models at work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580329)
