default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPPDP 2013: Madrid, Spain
- Ricardo Peña, Tom Schrijvers:
15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13, Madrid, Spain, September 16-18, 2013. ACM 2013, ISBN 978-1-4503-2154-9 - Yngve Lamo
, Florian Mantz, Adrian Rutle, Juan de Lara:
A declarative and bidirectional model transformation approach based on graph co-spans. 1-12 - Andrew Kennedy, Nick Benton, Jonas Braband Jensen, Pierre-Évariste Dagand:
Coq: the world's best macro assembler? 13-24 - Wojciech Jedynak, Malgorzata Biernacka, Dariusz Biernacki:
An operational foundation for the tactic language of Coq. 25-36 - Jael Kriener, Andy King, Sandrine Blazy:
Proofs you can believe in: proving equivalences between Prolog semantics in Coq. 37-48 - Jan Christiansen, Michael Hanus, Fabian Reck, Daniel Seidel:
A semantics for weakly encapsulated search in functional logic programs. 49-60 - Sergio Antoy, Andy Jost:
Are needed redexes really needed? 61-71 - Kazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano:
A parameterized graph transformation calculus for finite graphs with monadic branches. 73-84 - Álvaro García-Pérez, Pablo Nogueira, Juan José Moreno-Navarro:
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order. 85-96 - Olivier Danvy, Ian Zerny:
A synthetic operational account of call-by-need evaluation. 97-108 - Robert J. Simmons, Ian Zerny:
A logical correspondence between natural semantics and abstract machines. 109-119 - Jan Midtgaard, Norman Ramsey, Bradford Larsen:
Engineering definitional interpreters. 121-132 - John T. O'Donnell:
Extensible sparse functional arrays with circuit parallelism. 133-144 - Gordon Stewart, Anindya Banerjee, Aleksandar Nanevski:
Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures. 145-156 - Yuting Wang, Kaustuv Chaudhuri, Andrew Gacek, Gopalan Nadathur:
Reasoning about higher-order relational specifications. 157-168 - Louis Mandel, Cédric Pasteur, Marc Pouzet:
Time refinement in a functional synchronous language. 169-180 - Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
Unifying the Knuth-Bendix, recursive path and polynomial orders. 181-192 - Edward Robbins, Jacob M. Howe, Andy King:
Theory propagation and rational-trees. 193-204 - Edmund S. L. Lam, Iliano Cervesato:
Decentralized execution of constraint handling rules for ensembles. 205-216 - Rafael Caballero, Peter J. Stuckey, Antonio Tenorio-Fornes:
Finite type extensions in constraint programming. 217-227 - Roberto Bagnara, Fred Mesnard:
Eventual linear ranking functions. 229-238 - Marco Calautti, Sergio Greco, Irina Trubitsyna:
Detecting decidable classes of finitely ground logic programs with function symbols. 239-250 - Manuel Montenegro, Ricardo Peña, Clara Segura:
Shape analysis in a functional language by using regular languages. 251-262 - Luis Fernando Pino, Filippo Bonchi, Frank D. Valencia:
Efficient computation of program equivalence for confluent concurrent constraint programming. 263-274 - Stefan Holdermans:
Random testing of purely functional abstract datatypes: guidelines for dealing with operation invariance. 275-284 - Joana Côrte-Real, Inês de Castro Dutra, Ricardo Rocha:
Prolog programming with a map-reduce parallel construct. 285-296 - Kazutaka Matsuda, Meng Wang:
Bidirectionalization for free with runtime recording: or, a light-weight approach to the view-update problem. 297-308
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 2026-01-29 02:22 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:
