scientific article; zbMATH DE number 7438562
From MaRDI portal
Publication:5013873
zbMath1476.68182arXiv1508.06713MaRDI QIDQ5013873
Publication date: 3 December 2021
Full work available at URL: https://arxiv.org/abs/1508.06713
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Directly reflective meta-programming
- Categorical simulations
- The influence of domain interpretations on computational models
- The lambda calculus, its syntax and semantics
- On the expressive power of programming languages
- Normalization results for typeable rewrite systems
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Confluence of curried term-rewriting systems
- Towards a unified approach to encodability and separation results for process calculi
- Combinatory logic. Vol. II
- Expressiveness via Intensionality and Concurrency
- A combinatory account of internal structure
- Pattern Calculus
- Typed representation of objects by functions
- Efficient self-interpretation in lambda calculus
- The next 700 programming languages
- Computability structures, simulations and realizability
- An Unsolvable Problem of Elementary Number Theory
- On Computable Numbers, with an Application to the Entscheidungsproblem
This page was built for publication: