147 search results - page 6 / 30 » Relational Parametricity and Separation Logic |
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
102
click to vote
ICFP
2010
ACM
15 years 21 days ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
CADE
2001
Springer
15 years 12 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
88
Voted
JURIX
2008
15 years 1 months ago
2008
The two main types of law are legislation and precedents. Both types have a corresponding reasoning pattern determining legal consequences: legislation can be applied and precedent...
96
Voted
HIS
2003
15 years 1 months ago
2003
We logically model uncertainty by expanding language without changing logical reasoning rules. We expand the language of set theory by adding new predicate symbols, uncertain membe...