400 search results - page 18 / 80 » Logical relations for monadic types |
JAPLL
2011
13 years 2 months ago
2011
Due to the fact that a large number of our ethical and behavioural norms have a conditional form, it is of great importance that deontic logics give an account of deontic commitme...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
ITP
2010
13 years 11 months ago
2010
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...