1742 search results - page 120 / 349 » An Applicative Module Calculus |
LICS
2007
IEEE
14 years 5 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
FOSSACS
2007
Springer
14 years 5 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
PADL
2004
Springer
14 years 4 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...
LMO
1996
14 years 3 days ago
1996
We seek to support the development of open, distributed applications from patible software abstractions. In order to rigorously specify these abstractions, we are elaborating a for...
ENTCS
2008
13 years 11 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...