Higher-order pattern complement and the strict λ-calculus

DOI10.1145/937555.937559zbMath1365.68155arXivcs/0109072OpenAlexW2077870744MaRDI QIDQ5267440

Alberto Momigliano, Frank Pfenning

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0109072

zbMATH Keywords

complementhigher-order patternsstrict \(\lambda\)-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17) Combinatory logic and lambda calculus (03B40)

Related Items (2)

The undecidability of proof search when equality is a logical connective ⋮ αCheck: A mechanized metatheory model checker

Uses Software

• Elf

This page was built for publication: Higher-order pattern complement and the strict λ-calculus