The undecidability of pattern matching in calculi where primitive recursive functions are representable (Q1208421)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The undecidability of pattern matching in calculi where primitive recursive functions are representable |
scientific article; zbMATH DE number 166432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The undecidability of pattern matching in calculi where primitive recursive functions are representable |
scientific article; zbMATH DE number 166432 |
Statements
The undecidability of pattern matching in calculi where primitive recursive functions are representable (English)
0 references
16 May 1993
0 references
pattern matching
0 references
polymorphic \(\lambda\)-calculi
0 references
Girard's system \(F\)
0 references
calculi supporting inductive types
0 references
Gödel's system \(T\)
0 references
Hilbert's tenth problem
0 references
primitive recursive functions
0 references
0.7734559178352356
0 references
