39 search results - page 7 / 8 » Logical Relations and Inductive Coinductive Types |
123
click to vote
TLDI
2005
ACM
15 years 8 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
234
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
132
click to vote
LICS
1994
IEEE
15 years 7 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
133
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
123
click to vote
POPL
2010
ACM
16 years 15 days ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...