Name
Abstract | ||
|---|---|---|
Recently, a model theoretic semantics for lazy functional programmingcombining parametric and inclusion polymorphism has beenproposed in [2]. The aim of the present work is to provide the previousone with the incorporation of a typed lazy narrowing calculus forgoal solving which combines lazy unification, sharing and type checkingat run-time. Furthermore, we state soundness and completeness resultsof the goal solving procedure w.r.t. the typed rewriting calculi presentedin [2]... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0027009 | ALP/HOA |
Keywords | Field | DocType |
parametric order sorted types,polymorphism | Discrete mathematics,Functional programming,Computer science,Unification,Algorithm,Theoretical computer science,Computability,Parametric statistics,Rewriting,Soundness,Completeness (statistics),Semantics | Conference |
ISBN | Citations | PageRank |
3-540-63459-2 | 2 | 0.37 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. M. Almendros-JiméNez | 1 | 24 | 2.00 |
| Ana Gil-Luezas | 2 | 30 | 2.95 |