Type Soundness for Path Polymorphism

Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures. Its essence is captured by patterns of the form xy which decompose a compound data structure into its parts. Typing these kinds of patterns is challenging since the t...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Viso, A., Bonelli, E., Ayala-Rincón, M.
Formato: JOUR
Materias:
Path Polymorphism
Pattern Matching
Static Typing
λ-Calculus
Data structures
Differentiation (calculus)
Pattern matching
Compound data structure
Fundamental properties
Pattern calculus
Recursive types
Run-time analysis
Static type systems
Static typing
Subject reduction
Calculations
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15710661_v323_n_p235_Viso
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares