Sciweavers

215 search results - page 14 / 43
» Connecting a Logical Framework to a First-Order Logic Prover
Sort
View
SARA
2007
Springer
16 years 2 days ago
Extensional Reasoning
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
Timothy L. Hinrichs
CORR
2011
Springer
173views Education» more  CORR 2011»
15 years 29 days ago
Psi-calculi: a framework for mobile processes with nominal data and logic
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
SYNTHESE
2010
95views more  SYNTHESE 2010»
15 years 4 months ago
Ranking judgments in Arrow's setting
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
Daniele Porello
TPHOL
2009
IEEE
16 years 18 days ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
POPL
2007
ACM
16 years 6 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish