Encoding the factorisation calculus

MaRDI QIDQ5013873zbMATH OpenFDO

Authors Reuben N. S. Rowe

Publication date 3 December 2021

Full work available at URL https://arxiv.org/abs/1508.06713, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2015.6

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A combinatory account of internal structure
• Programs as data structures in \(\lambda\)SF-calculus
• Intensional computation with higher-order functions
• Expressiveness via intensionality and concurrency
• Typed Lambda Calculi and Applications

Cites work

• A combinatory account of internal structure
• An Unsolvable Problem of Elementary Number Theory
• Categorical simulations
• Combinatory logic. Vol. II
• Computability structures, simulations and realizability
• Confluence of curried term-rewriting systems
• Directly reflective meta-programming
• Efficient self-interpretation in lambda calculus
• Expressiveness via intensionality and concurrency
• scientific article; zbMATH DE number 3922632 (Why is no real title available?)
• scientific article; zbMATH DE number 515729 (Why is no real title available?)
• scientific article; zbMATH DE number 1006119 (Why is no real title available?)
• scientific article; zbMATH DE number 944097 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Normalization results for typeable rewrite systems
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the expressive power of programming languages
• Pattern Calculus
• Perpetuality and uniform normalization in orthogonal rewrite systems
• The -calculus: A theory of mobile processes
• The influence of domain interpretations on computational models
• The lambda calculus, its syntax and semantics
• The next 700 programming languages
• Towards a unified approach to encodability and separation results for process calculi
• Typed representation of objects by functions

Cited in

(3)

• Programs as data structures in \(\lambda\)SF-calculus
• A combinatory account of internal structure
• Computing \(\widehat {HF}\) by factoring mapping

This page was built for publication: Encoding the factorisation calculus

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