Sciweavers

331 search results - page 5 / 67
» HOLCF: Higher Order Logic of Computable Functions
Sort
View
POPL
2010
ACM
15 years 6 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
JAR
2008
77views more  JAR 2008»
14 years 9 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
74
Voted
ESOP
2009
Springer
15 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
SAC
2011
ACM
14 years 8 days ago
Quotients revisited for Isabelle/HOL
Higher-Order Logic (HOL) is based on a small logic kernel, whose
Cezary Kaliszyk, Christian Urban
BIRTHDAY
2010
Springer
14 years 9 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller