20 search results - page 4 / 4 » Faithful Ideal Models for Recursive Polymorphic Types |
TLCA
2009
Springer
13 years 11 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
JFP
2006
13 years 5 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
VISUALIZATION
1994
IEEE
13 years 9 months ago
1994
IEEE
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
FPCA
1995
13 years 8 months ago
1995
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...