Word operation definable in the typed \(\lambda\)-calculus

DOI10.1016/0304-3975(87)90077-6zbMath0638.03014OpenAlexW2090288940MaRDI QIDQ1099156

Marek Zaionc

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90077-6

zbMATH Keywords

typed lambda calculuslambda-definabilityrepresentability of word functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Combinatory logic and lambda calculus (03B40)

Related Items (6)

A characterization of lambda-terms transforming numerals ⋮ A characterization of lambda definable tree operations ⋮ Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered ⋮ LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS ⋮ Ordinals and ordinal functions representable in the simply typed lambda calculus ⋮ \(\lambda\)-definability of free algebras

Cites Work

• The lambda calculus, its syntax and semantics
• On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
• A unification algorithm for typed \(\overline\lambda\)-calculus
• The typed lambda-calculus is not elementary recursive
• λ-definable functionals andβη conversion
• Definierbare Funktionen imλ-Kalkül mit Typen
• Axiom schemes for m-valued propositions calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Word operation definable in the typed \(\lambda\)-calculus