85 search results - page 12 / 17 » A Logic for Reasoning with Higher-Order Abstract Syntax |
ENTCS
2007
14 years 11 months ago
2007
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of alg...
116
Voted
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
184
click to vote
POPL
2006
ACM
16 years 2 hour ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
118
click to vote
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
105
click to vote
CC
2003
Springer
15 years 4 months ago
2003
Springer
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...