A combinatory account of internal structure

DOI10.2178/JSL/1309952521zbMATH Open1248.03025OpenAlexW2046825040MaRDI QIDQ3173527FDOQ3173527

Authors: Thomas Given-Wilson, Barry Jay 

Publication date: 10 October 2011

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

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

Recommendations

• Encoding the factorisation calculus
• On structure and extensionality of fixed-point combinators in CL\(w\)
• On combinatory complete sets of proper combinators
• A category-theoretic characterization of functional completeness
• Combinators and structurally free logic

zbMATH Keywords

combinatory logic

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Intensional computation with higher-order functions
• Title not available (Why is that?)
• Programs as data structures in \(\lambda\)SF-calculus
• Self-quotation in a typed, intensional lambda-calculus
• Title not available (Why is that?)
• Expressiveness of concurrent intensionality
• On the Expressiveness of Symmetric Communication
• Conflicting accounts of \(\lambda\)-definability
• Title not available (Why is that?)

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

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