Sciweavers

3658 search results - page 320 / 732
» The logic of proofs, semantically
Sort
View
PADL
2004
Springer
16 years 5 days ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
SP
1998
IEEE
106views Security Privacy» more  SP 1998»
15 years 11 months ago
Understanding Java Stack Inspection
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
Dan S. Wallach, Edward W. Felten
ICLP
2007
Springer
16 years 1 months ago
Core TuLiP Logic Programming for Trust Management
We propose CoreTuLiP - the core of a trust management language based on Logic Programming. CoreTuLiP is based on a subset of moded logic programming, but enjoys the features of TM ...
Marcin Czenko, Sandro Etalle
ASIAN
1999
Springer
99views Algorithms» more  ASIAN 1999»
15 years 11 months ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr...
JELIA
2000
Springer
15 years 10 months ago
Considerations on Updates of Logic Programs
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...