scientific article; zbMATH DE number 3935004

zbMATH Open0584.03010MaRDI QIDQ3708774FDOQ3708774

Authors: Marek Zaionc 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

infinite treesunification problemregular expressiontyped lambda- calculusterm grammars

Mathematics Subject Classification ID

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

Cited In (9)

• Higher-order unification revisited: Complete sets of transformations
• \(\lambda\)-definability of free algebras
• Title not available (Why is that?)
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
• A \(\lambda\)-unifiability test for set theory
• Title not available (Why is that?)
• Third order matching is decidable
• A characterization of lambda definable tree operations
• Word operation definable in the typed \(\lambda\)-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)