Sciweavers

756 search results - page 119 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
FUIN
2007
99views more  FUIN 2007»
14 years 11 months ago
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carryingcode provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set o...
Amy P. Felty
RTA
2005
Springer
15 years 5 months ago
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
Amy P. Felty
LOGCOM
2000
63views more  LOGCOM 2000»
14 years 11 months ago
Reflection principles in computational logic
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Co...
CORR
2008
Springer
179views Education» more  CORR 2008»
14 years 12 months ago
Induction and Co-induction in Sequent Calculus
Abstract. 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...
Alwen Tiu, Alberto Momigliano
ICFP
2005
ACM
15 years 11 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney