Ricardo Peña, Tom Schrijvers
Proceedings of the 15th International Conference on Principles and Practice of Declarative Programming
PPDP, 2013.

@proceedings{PPDP-2013,
	acmid         = "2505879",
	address       = "Madrid, Spain",
	editor        = "Ricardo Peña and Tom Schrijvers",
	isbn          = "978-1-4503-2154-9",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 15th International Conference on Principles and Practice of Declarative Programming}",
	year          = 2013,
}

Contents (26 items)

5 ×#functional
4 ×#semantics
3 ×#constraints
3 ×#coq
3 ×#programming
2 ×#approach
2 ×#bidirectional
2 ×#data type
2 ×#finite
2 ×#graph

PPDP-2013-LamoMRL #approach #bidirectional #declarative #graph #model transformation

A declarative and bidirectional model transformation approach based on graph co-spans (YL, FM, AR, JdL), pp. 1–12.

PPDP-2013-KennedyBJD #assembly #coq #metaprogramming #named #question

Coq: the world’s best macro assembler? (AK, NB, JBJ, PÉD), pp. 13–24.

PPDP-2013-JedynakBB #coq

An operational foundation for the tactic language of Coq (WJ, MB, DB), pp. 25–36.

PPDP-2013-KrienerKB #coq #prolog #proving #semantics

Proofs you can believe in: proving equivalences between Prolog semantics in Coq (JK, AK, SB), pp. 37–48.

PPDP-2013-ChristiansenHRS #encapsulation #functional #logic programming #semantics #source code

A semantics for weakly encapsulated search in functional logic programs (JC, MH, FR, DS), pp. 49–60.

PPDP-2013-AntoyJ #question

Are needed redexes really needed? (SA, AJ), pp. 61–71.

PPDP-2013-AsadaHKHN #branch #calculus #finite #graph #graph transformation #monad

A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.

PPDP-2013-Garcia-PerezNM #order #semantics

Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order (ÁGP, PN, JJMN), pp. 85–96.

PPDP-2013-DanvyZ #call-by #evaluation

A synthetic operational account of call-by-need evaluation (OD, IZ), pp. 97–108.

PPDP-2013-SimmonsZ #automaton #logic #semantics

A logical correspondence between natural semantics and abstract machines (RJS, IZ), pp. 109–119.

PPDP-2013-MidtgaardRL

Engineering definitional interpreters (JM, NR, BL), pp. 121–132.

PPDP-2013-ODonnell #array #functional #parallel

Extensible sparse functional arrays with circuit parallelism (JTO), pp. 133–144.

PPDP-2013-StewartBN #data flow #data type #dependent type #policy #semistructured data

Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures (GS, AB, AN), pp. 145–156.

PPDP-2013-WangCGN #higher-order #reasoning #relational #specification

Reasoning about higher-order relational specifications (YW, KC, AG, GN), pp. 157–168.

PPDP-2013-MandelPP #functional #refinement

Time refinement in a functional synchronous language (LM, CP, MP), pp. 169–180.

PPDP-2013-YamadaKS #order #polynomial #recursion

Unifying the Knuth-Bendix, recursive path and polynomial orders (AY, KK, TS), pp. 181–192.

PPDP-2013-RobbinsHK

Theory propagation and rational-trees (ER, JMH, AK), pp. 193–204.

PPDP-2013-LamC #constraints #distributed #execution

Decentralized execution of constraint handling rules for ensembles (ESLL, IC), pp. 205–216.

PPDP-2013-CaballeroST #constraints #finite #programming

Finite type extensions in constraint programming (RC, PJS, ATF), pp. 217–227.

PPDP-2013-BagnaraM #linear #ranking

Eventual linear ranking functions (RB, FM), pp. 229–238.

PPDP-2013-CalauttiGT #decidability #detection #logic programming #source code

Detecting decidable classes of finitely ground logic programs with function symbols (MC, SG, IT), pp. 239–250.

PPDP-2013-MontenegroPS #analysis #functional #regular expression #using

Shape analysis in a functional language by using regular languages (MM, RP, CS), pp. 251–262.

PPDP-2013-PinoBV #concurrent #confluence #constraints #equivalence #performance #programming

Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.

PPDP-2013-Holdermans #data type #functional #guidelines #random testing #testing

Random testing of purely functional abstract datatypes: guidelines for dealing with operation invariance (SH), pp. 275–284.

PPDP-2013-Corte-RealDR #parallel #programming #prolog

Prolog programming with a map-reduce parallel construct (JCR, IdCD, RR), pp. 285–296.

PPDP-2013-MatsudaW #approach #bidirectional #for free #problem #runtime

Bidirectionalization for free with runtime recording: or, a light-weight approach to the view-update problem (KM, MW), pp. 297–308.