default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPPDP 2003: Uppsala, Sweden
- Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 27-29 August 2003, Uppsala, Sweden. ACM 2003, ISBN 1-58113-705-2
- Bruno Blanchet:
Automatic verification of cryptographic protocols: a logic programming approach. 1-3 - Mogens Nielsen, Karl Krukow:
Towards a formal notion of trust. 4-7 - Mads Sig Ager, Dariusz Biernacki
, Olivier Danvy, Jan Midtgaard:
A functional correspondence between evaluators and abstract machines. 8-19 - Sergio Antoy, Bernd Brassel, Michael Hanus:
Conditional narrowing without conditions. 20-31 - Maria J. García de la Banda, Peter J. Stuckey, Jeremy Wazny:
Finding all minimal unsatisfiable subsets. 32-43 - Omid Banyasad, Philip T. Cox:
On translating geometric solids to functional expressions. 44-55 - M. Cameron, Maria J. García de la Banda, Kim Marriott, Peter Moulder:
ViMer: a visual debugger for mercury. 56-66 - Ferruccio Damiani:
Rank 2 intersection types for modules. 67-78 - Gregory J. Duck, Peter J. Stuckey, Maria J. García de la Banda, Christian Holzbaur:
Extending arbitrary solvers with constraint handling rules. 79-90 - Rachid Echahed, Frédéric Prost, Wendelin Serwe:
Statically assuring secrecy for dynamic concurrent processes. 91-101 - Alberto de la Encina, Ricardo Pena:
Formally deriving an STG machine. 102-112 - Santiago Escobar:
Refining weakly outermost-needed rewriting and narrowing. 113-123 - Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
Simplification and termination of strategies in rule-based languages. 124-135 - Sergio Greco, Ester Zumpano:
On the rewriting and efficient computation of bound disjunctive datalog queries. 136-147 - Makoto Hamana:
Term rewriting with variable binding: an initial algebra approach. 148-159 - Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. 160-171 - Yanhong A. Liu, Scott D. Stoller:
From datalog rules to efficient programs with time and space guarantees. 172-183 - Marino Miculan, Ivan Scagnetto:
A framework for typed HOAS and semantics. 184-194 - Gopalan Nadathur, Xiaochu Qi:
Explicit substitutions in the reduction of lambda terms. 195-206 - Aleksandar Nanevski:
From dynamic binding to state via modal possibility. 207-218 - Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi:
Integrating finite domain constraints and CLP with sets. 219-229 - Bernard J. Pope, Lee Naish:
Practical aspects of declarative debugging in Haskell 98. 230-240 - Andreas Rossberg:
Generativity and dynamic opacity for abstract types. 241-252 - Rafael del Vado Vírseda:
A demand-driven narrowing calculus with overlapping definitional trees. 253-263 - Dinghao Wu, Andrew W. Appel, Aaron Stump:
Foundational proof checkers with small witnesses. 264-274 - Neng-Fa Zhou, Taisuke Sato:
Efficient fixpoint computation in linear tabling. 275-283
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
