scientific article; zbMATH DE number 3935004

MaRDI QIDQ3708774zbMATH OpenFDO

Authors Marek Zaionc

Publication date 1985

zbMATH Keywords

infinite treesregular expressionterm grammarstyped lambda- calculusunification problem

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4068831
• scientific article; zbMATH DE number 1302672
• A -unifiability test for set theory
• Decidability of bounded higher-order unification
• scientific article; zbMATH DE number 1948184

Cited in

(11)

• Word operation definable in the typed -calculus
• Third order matching is decidable
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
• Higher-order unification revisited: Complete sets of transformations
• scientific article; zbMATH DE number 4068831 (Why is no real title available?)
• scientific article; zbMATH DE number 1302672 (Why is no real title available?)
• Efficient full higher-order unification
• Efficient full higher-order unification
• A -unifiability test for set theory
• \(\lambda\)-definability of free algebras
• A characterization of lambda definable tree operations

This page was built for publication:

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