Type Inhabitation
CHF 43.05
Auf Lager
SKU
TSBNQ7V5QNF
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Fr., 31.10.2025 und Mo., 03.11.2025
Details
High Quality Content by WIKIPEDIA articles! In type theory, a branch of mathematical logic, in a given typed calculus. In the case of simply typed lambda calculus, a type has an inhabitant if and only if its corresponding proposition is a tautology of minimal implicative logic. Similarly, a System F type has an inhabitant if and only if its corresponding proposition is a tautology of second-order logic. For most typed calculus, the type inhabitation problem is very hard. Richard Statman proved that for simply typed lambda calculus the type inhabitation problem is PSPACE-complete. For other calculi, like System F, the problem is even undecidable.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131151637
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131151637
- Format Fachbuch
- Titel Type Inhabitation
- Herausgeber Betascript Publishing
- Anzahl Seiten 88
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
