|
|
Conferences in DBLP
- Bruno Blanchet
Automatic verification of cryptographic protocols: a logic programming approach. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:1-3 [Conf]
- Mogens Nielsen, Karl Krukow
Towards a formal notion of trust. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:4-7 [Conf]
- Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard
A functional correspondence between evaluators and abstract machines. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:8-19 [Conf]
- Sergio Antoy, Bernd Brassel, Michael Hanus
Conditional narrowing without conditions. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:20-31 [Conf]
- Maria J. García de la Banda, Peter J. Stuckey, Jeremy Wazny
Finding all minimal unsatisfiable subsets. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:32-43 [Conf]
- Omid Banyasad, Philip T. Cox
On translating geometric solids to functional expressions. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:44-55 [Conf]
- M. Cameron, Maria J. García de la Banda, Kim Marriott, Peter Moulder
ViMer: a visual debugger for mercury. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:56-66 [Conf]
- Ferruccio Damiani
Rank 2 intersection types for modules. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:67-78 [Conf]
- Gregory J. Duck, Peter J. Stuckey, Maria J. García de la Banda, Christian Holzbaur
Extending arbitrary solvers with constraint handling rules. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:79-90 [Conf]
- Rachid Echahed, Frédéric Prost, Wendelin Serwe
Statically assuring secrecy for dynamic concurrent processes. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:91-101 [Conf]
- Alberto de la Encina, Ricardo Pena
Formally deriving an STG machine. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:102-112 [Conf]
- Santiago Escobar
Refining weakly outermost-needed rewriting and narrowing. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:113-123 [Conf]
- Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner
Simplification and termination of strategies in rule-based languages. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:124-135 [Conf]
- Sergio Greco, Ester Zumpano
On the rewriting and efficient computation of bound disjunctive datalog queries. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:136-147 [Conf]
- Makoto Hamana
Term rewriting with variable binding: an initial algebra approach. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:148-159 [Conf]
- Tom Hirschowitz, Xavier Leroy, J. B. Wells
Compilation of extended recursion in call-by-value functional languages. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:160-171 [Conf]
- Yanhong A. Liu, Scott D. Stoller
From datalog rules to efficient programs with time and space guarantees. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:172-183 [Conf]
- Marino Miculan, Ivan Scagnetto
A framework for typed HOAS and semantics. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:184-194 [Conf]
- Gopalan Nadathur, Xiaochu Qi
Explicit substitutions in the reduction of lambda terms. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:195-206 [Conf]
- Aleksandar Nanevski
From dynamic binding to state via modal possibility. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:207-218 [Conf]
- Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi
Integrating finite domain constraints and CLP with sets. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:219-229 [Conf]
- Bernard Pope, Lee Naish
Practical aspects of declarative debugging in Haskell 98. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:230-240 [Conf]
- Andreas Rossberg
Generativity and dynamic opacity for abstract types. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:241-252 [Conf]
- Rafael del Vado Vírseda
A demand-driven narrowing calculus with overlapping definitional trees. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:253-263 [Conf]
- Dinghao Wu, Andrew W. Appel, Aaron Stump
Foundational proof checkers with small witnesses. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:264-274 [Conf]
- Neng-Fa Zhou, Taisuke Sato
Efficient fixpoint computation in linear tabling. [Citation Graph (0, 0)][DBLP]
PPDP, 2003, pp:275-283 [Conf]
|
