Sciweavers

2152 search results - page 171 / 431
» On Automating the Calculus of Relations
Sort
View
JLP
2011
160views more  JLP 2011»
15 years 1 months ago
Axiomatizability of representable domain algebras
The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. represen...
Robin Hirsch, Szabolcs Mikulás
LPNMR
2011
Springer
14 years 9 months ago
Integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report)
We present an approach to integrating rules and ontologies on the basis of the first-order stable model semantics defined by Ferraris, Lee and Lifschitz. We show that a few exist...
Joohyung Lee, Ravi Palla
IFIP
2004
Springer
15 years 11 months ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells
JFP
2007
111views more  JFP 2007»
15 years 6 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
PPDP
2010
Springer
15 years 4 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann