Solvability = Typability + Inhabitation
We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on non-idempotent types. We show first that the system P characterizes the...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Logical Methods in Computer Science e.V.
2021-01-01
|
| Saila: | Logical Methods in Computer Science |
| Gaiak: | |
| Sarrera elektronikoa: | https://lmcs.episciences.org/5041/pdf |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|