Sciweavers

1143 search results - page 6 / 229
» Abstract Syntax and Logic Programming
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
MSCS
2006
69views more  MSCS 2006»
13 years 7 months ago
A categorical quantum logic
We define a sequent calculus corresponding to the logic of strongly compact closed categories with biproducts. Based on this calculus, we define a proof-net syntax with ly normali...
Samson Abramsky, Ross Duncan
LISP
2006
160views more  LISP 2006»
13 years 7 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin
ICLP
1991
Springer
13 years 11 months ago
Abstract Interpretation of Logic Programs
Interpretation of Logic Programs 1
Patrick Cousot
PPDP
2009
Springer
14 years 1 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano