277 search results - page 22 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
131
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
100
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
Self-representation – the ability to represent programs in their own language – has important applications in reflective languages and many other domains of programming langu...
138
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
141
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
120
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...