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...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Logical Methods in Computer Science e.V.
2021-01-01
|
| Col·lecció: | Logical Methods in Computer Science |
| Matèries: | |
| Accés en línia: | https://lmcs.episciences.org/5041/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|