Definierbare Funktionen imλ-Kalkül mit Typen

DOI10.1007/BF02276799zbMATH Open0329.02011DBLPjournals/aml/Schwichtenberg75OpenAlexW2334137773WikidataQ63090393 ScholiaQ63090393MaRDI QIDQ4094854FDOQ4094854

Authors: Helmut Schwichtenberg 

Publication date: 1976

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137913

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Combinatory logic. Vol. II
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Lambda-representable functions over term algebras
• Introduction to Type Theory
• The Typed Böhm Theorem
• An analysis of the Core-ML language: Expressive power and type reconstruction
• The typed lambda-calculus is not elementary recursive
• \(\lambda\)-definability of free algebras
• Ordinals and ordinal functions representable in the simply typed lambda calculus
• Functions over free algebras definable in the simply typed lambda calculus
• Word operation definable in the typed \(\lambda\)-calculus
• A characterization of lambda-terms transforming numerals
• A quantitative model for simply typed λ-calculus

This page was built for publication: Definierbare Funktionen imλ-Kalkül mit Typen

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