Sciweavers

133 search results - page 11 / 27
» The basic intuitionistic logic of proofs
Sort
View
CADE
2005
Springer
14 years 7 months ago
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
Kaustuv Chaudhuri, Frank Pfenning
PADL
2007
Springer
14 years 25 days ago
Aspect-Oriented Programming in Higher-Order and Linear Logic
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
Chuck C. Liang
ICFP
2005
ACM
14 years 6 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
LOPSTR
2004
Springer
14 years 2 days ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
ENTCS
2007
91views more  ENTCS 2007»
13 years 6 months ago
A Logic for Reasoning about Generic Judgments
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆ of Miller and Tiu, with an induction principle. The logic FOλ∆ is itself an...
Alwen Tiu