Sciweavers

238 search results - page 17 / 48
» Program Abstraction in a Higher-Order Logic Framework
Sort
View
CC
2003
Springer
250views System Software» more  CC 2003»
14 years 1 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...
COMMA
2008
13 years 10 months ago
A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Teresa Alsinet, Carlos Iván Chesñeva...
ECSQARU
2005
Springer
14 years 2 months ago
A Possibilistic Inconsistency Handling in Answer Set Programming
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
PLILP
1993
Springer
14 years 21 days ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
LICS
1992
IEEE
14 years 21 days ago
Compiler Verification in LF
We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this techni...
John Hannan, Frank Pfenning