scientific article; zbMATH DE number 3935004

MaRDI QIDQ3708774zbMATH OpenFDO

Authors Marek Zaionc

Publication date 1985

zbMATH Keywords

infinite treesunification problemregular expressiontyped lambda- calculusterm grammars

Mathematics Subject Classification ID

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

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

(9)

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

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)