564 search results - page 14 / 113 » Dependent types and program equivalence |
PADL
2004
Springer
14 years 1 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
AGP
1998
IEEE
13 years 12 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
POPL
2009
ACM
14 years 8 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...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
COMPASS
1994
13 years 11 months ago
1994
ASL+ is a formalism for speci cation and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and re nement of speci cations, whic...