Elvira Albert, Shin-Cheng Mu
Proceedings of the 18th Workshop on Partial Evaluation and Program Manipulation
PEPM, 2013.

@proceedings{PEPM-2013,
	acmid         = "2426890",
	address       = "Rome, Italy",
	editor        = "Elvira Albert and Shin-Cheng Mu",
	isbn          = "978-1-4503-1842-6",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 18th Workshop on Partial Evaluation and Program Manipulation}",
	year          = 2013,
}

Contents (19 items)

3 ×#source code
2 ×#automation
2 ×#domain-specific language
2 ×#fault
2 ×#functional
2 ×#higher-order
2 ×#type system
2 ×#using

PEPM-2013-Hu #aspect-oriented #bidirectional #graph transformation

Practical aspects of bidirectional graph transformations (ZH), pp. 1–2.

PEPM-2013-WeijersHH #fault #higher-order #polymorphism #security

Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 3–12.

PEPM-2013-Simon #type inference #using

Deriving a complete type inference for hindley-milner and vector sizes using expansion (AS), pp. 13–22.

PEPM-2013-Lopez-FraguasM #evaluation #functional #type system

Typing as functional-logic evaluation (FJLF, EMM), pp. 23–32.

PEPM-2013-SagonasST #fault #precise #type system

Precise explanation of success typing errors (KFS, JS, ST), pp. 33–42.

PEPM-2013-AngelisFPP #source code #verification

Verifying programs via iterated specialization (EDA, FF, AP, MP), pp. 43–52.

PEPM-2013-SatoUK #higher-order #model checking #scalability #source code #towards

Towards a scalable software model checker for higher-order programs (RS, HU, NK), pp. 53–62.

PEPM-2013-CarbinKMR #approximate #program transformation

Verified integrity properties for safe approximate program transformations (MC, DK, SM, MCR), pp. 63–66.

PEPM-2013-CominiT #automation #equivalence #linear #named #term rewriting

TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems (MC, LT), pp. 67–70.

PEPM-2013-SulzmannNZ #abstraction #correctness #traceability

Traceability and evidence of correctness of EDSL abstractions (MS, JNF, AZ), pp. 71–74.

PEPM-2013-Thiemann

Partially static operations (PT), pp. 75–76.

PEPM-2013-MartinezVP #compilation #exclamation #haskell #performance

Just do it while compiling!: fast extensible records in haskell (BM, MV, AP), pp. 77–86.

PEPM-2013-OliveiraL #domain-specific language #graph #syntax

Abstract syntax graphs for domain specific languages (BCdSO, AL), pp. 87–96.

PEPM-2013-DevrieseSCP #domain-specific language #recursion

Fixing idioms: a recursion primitive for applicative DSLs (DD, IS, DC, FP), pp. 97–106.

PEPM-2013-Garcia-PerezN #functional #reduction #semantics

A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers (ÁGP, PN), pp. 107–116.

PEPM-2013-ServettoZ #library

A meta-circular language for active libraries (MS, EZ), pp. 117–126.

PEPM-2013-AlpuenteFV #automation #logic #specification #using

Automatic inference of specifications using matching logic (MA, MAF, AV), pp. 127–136.

PEPM-2013-SunCZ #analysis #constraints #locality #source code

Constraint-based locality analysis for X10 programs (QS, YC, JZ), pp. 137–146.

PEPM-2013-AktemurKKS #challenge #generative #programming

Shonan challenge for generative programming: short position paper (BA, YK, OK, CcS), pp. 147–154.