Ohana trees and Taylor expansion for the -calculus: no variable gets left behind or forgotten!
From MaRDI portal
Publication:7296806
Cites work
- A lambda calculus satellite
- A new coinductive confluence proof for infinitary lambda calculus
- A semantic account of strong normalization in linear logic
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
- Approximate Reduction and Lambda Calculus Models
- Böhm and Taylor for all!
- Böhm's theorem for resource lambda calculus through Taylor expansion
- Characterization theorems for a filter lambda model
- Complete restrictions of the intersection type discipline
- Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
- Exponentials with infinite multiplicities
- Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
- Higher-order parity automata
- Highlights in infinitary rewriting and lambda calculus
- scientific article; zbMATH DE number 92599 (Why is no real title available?)
- scientific article; zbMATH DE number 1333599 (Why is no real title available?)
- scientific article; zbMATH DE number 512781 (Why is no real title available?)
- scientific article; zbMATH DE number 937379 (Why is no real title available?)
- scientific article; zbMATH DE number 7089070 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- Infinitary lambda calculi and böhm models
- Intersection types for -trees
- Logical Approaches to Computational Barriers
- Non-monotonic pre-fix points and learning
- Relational graph models at work
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Strong normalization and typability with intersection types
- Structural rules and algebraic properties of intersection types
- The calculi of lambda-conversion.
- The differential lambda-calculus
- The fixed point property and a technique to harness double fixed point combinators
- The infinitary lambda calculus of the infinite eta Böhm trees
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The Lattice of Lambda Theories
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- The relational model is injective for multiplicative exponential linear logic (without weakenings)
- Uniformity and the Taylor expansion of ordinary lambda-terms
This page was built for publication: Ohana trees and Taylor expansion for the \(\lambda\text{I}\)-calculus: no variable gets left behind or forgotten!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296806)
