A combinatory account of internal structure

DOI10.2178/jsl/1309952521zbMath1248.03025OpenAlexW2046825040MaRDI QIDQ3173527

Thomas Given-Wilson, C. Barry Jay

Publication date: 10 October 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/14486

zbMATH Keywords

combinatory logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (9)

Self-quotation in a typed, intensional lambda-calculus ⋮ On the Expressiveness of Symmetric Communication ⋮ Expressiveness of concurrent intensionality ⋮ Unnamed Item ⋮ Intensional computation with higher-order functions ⋮ Programs as data structures in \(\lambda\)SF-calculus ⋮ Conflicting accounts of \(\lambda\)-definability ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatory logic. Vol. II
• Recursive functions of symbolic expressions and their computation by machine, Part I
• First-class patterns
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Proving Properties of Programs by Structural Induction
• Tree-Manipulating Systems and Church-Rosser Theorems
• An Unsolvable Problem of Elementary Number Theory

This page was built for publication: A combinatory account of internal structure