default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPPDP 2010: Hagenberg, Austria
- Temur Kutsia, Wolfgang Schreiner, Maribel Fernández:
Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 26-28, 2010, Hagenberg, Austria. ACM 2010, ISBN 978-1-4503-0132-9 - Maria Paola Bonacina:
On theorem proving for program checking: historical perspective and recent developments. 1-12 - Sumit Gulwani:
Dimensions in program synthesis. 13-24 - K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. Liu:
Graph queries through datalog optimizations. 25-34 - K. Tuncay Tekle, Yanhong A. Liu:
Precise complexity analysis for efficient datalog queries. 35-44 - Senlin Liang, Michael Kifer:
Deriving predicate statistics in datalog. 45-56 - Thierry Martinez:
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules. 57-66 - Miquel Bofill
, Dídac Busquets, Mateu Villaret:
A declarative approach to robust weighted Max-SAT. 67-76 - Yukiyoshi Kameyama, Asami Tanaka:
Equational axiomatization of call-by-name delimited control. 77-86 - Kenichi Asai, Arisa Kitani:
Functional derivation of a virtual machine for delimited continuations. 87-98 - Carl Friedrich Bolz, Michael Leuschel, David Schneider:
Towards a jitting VM for prolog execution. 99-108 - Manuel Serrano:
HSS: a compiler for cascading style sheets. 109-118 - Florent Jacquemard, Michaël Rusinowitch:
Rewrite-based verification of XML updates. 119-130 - Paul Tarau:
Declarative modeling of finite mathematics. 131-142 - Wolfgang Jeltsch:
Generic record combinators with static type checking. 143-154 - Franco Barbanera, Ugo de'Liguoro:
Two notions of sub-behaviour for session-based client/server systems. 155-164 - Gilles Dowek, Murdoch James Gabbay:
Permissive-nominal logic. 165-176 - Andrew Gacek:
Relating nominal and higher-order abstract syntax specifications. 177-186 - Zachary Snow, David Baelde, Gopalan Nadathur:
A meta-programming approach to realizing dependently typed logic programming. 187-198 - Paul Fodor, Michael Kifer:
Tabling for transaction logic. 199-208 - Romain Demeyer, Maxime Van Assche, Ludovic Langevine, Wim Vanhoof:
Declarative workflows to efficiently manage flexible and advanced business processes. 209-218 - Patrick Baillot, Martin Hofmann:
Type inference in intuitionistic linear logic. 219-230 - Thibaut Balabonski:
Optimality for dynamic patterns. 231-242 - Claus Brabrand, Jakob G. Thomsen:
Typed and unambiguous pattern matching on strings using regular expressions. 243-254
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-10-31 20:21 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:
