Combinatorics of $\lambda$-terms: a natural approach

DOI10.1093/logcom/exx018zbMath1444.03187OpenAlexW2963578516MaRDI QIDQ3133181

Daniel Găină

Publication date: 13 February 2018

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exx018

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) Classical first-order logic (03B10) Type theory (03B38)

Related Items (5)

Birkhoff style calculi for hybrid logics ⋮ Stability of termination and sufficient-completeness under pushouts via amalgamation ⋮ Unnamed Item ⋮ Generalised graded interpolation ⋮ Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

This page was built for publication: Combinatorics of $\lambda$-terms: a natural approach