Pages that link to "Item:Q3011126"

The following pages link to A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126):

Displaying 1 item.

• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness (Q730088) (← links)