John P. Gallagher, Janis Voigtländer
Proceedings of the 15th Workshop on Partial Evaluation and Program Manipulation
PEPM, 2010.

@proceedings{PEPM-2010,
	acmid         = "1706356",
	address       = "Madrid, Spain",
	editor        = "John P. Gallagher and Janis Voigtländer",
	isbn          = "978-1-60558-727-1",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 15th Workshop on Partial Evaluation and Program Manipulation}",
	year          = 2010,
}

Contents (20 items)

3 ×#bytecode
3 ×#named
2 ×#detection
2 ×#haskell
2 ×#java
2 ×#optimisation
2 ×#programming
2 ×#termination

PEPM-2010-Augustsson #question

O, partial evaluator, where art thou? (LA), pp. 1–2.

PEPM-2010-Siek #metalanguage

General purpose languages should be metalanguages (JGS), pp. 3–4.

PEPM-2010-BoustaniH #java #source code

Corrective hints for type incorrect generic Java programs (NEB, JH), pp. 5–14.

PEPM-2010-RudolphT #bytecode #code generation #named #runtime #type safety

Mnemonics: type-safe bytecode generation at run time (JR, PT), pp. 15–24.

PEPM-2010-AlbertGP #bytecode #generative #java #named #partial evaluation #testing

PET: a partial evaluation-based test case generation tool for Java bytecode (EA, MGZ, GP), pp. 25–28.

PEPM-2010-Hofmann #functional #induction #named #programming

IGOR2 — an analytical inductive functional programming system: tool demo (MH0), pp. 29–32.

PEPM-2010-MagalhaesHJL #exclamation #optimisation

Optimizing generics is easy! (JPM, SH, JJ, AL), pp. 33–42.

PEPM-2010-AlpuenteBBF #framework

A fold/unfold transformation framework for rewrite theories extended to CCT (MA, DB, MB, MF), pp. 43–52.

PEPM-2010-AndersonK #approximate #bound #termination

Regular approximation and bounded domains for size-change termination (HA, SCK), pp. 53–62.

PEPM-2010-ContejeanPUCPF #approach #automation #proving #termination

A3PAT, an approach for certified automated termination proofs (EC, AP, XU, PC, OP, JF), pp. 63–72.

PEPM-2010-Henglein #algebra #equivalence #lazy evaluation #optimisation #relational #using

Optimizing relational algebra operations using generic equivalence discriminators and lazy products (FH), pp. 73–82.

PEPM-2010-RiescoR #nondeterminism #programming

Programming with singular and plural non-deterministic functions (AR, JRH), pp. 83–92.

PEPM-2010-HofmannK #detection #morphism #problem #towards #using

I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP (MH, EK), pp. 93–100.

PEPM-2010-MossP #implementation #performance

Bridging the gap between symbolic and efficient AES implementations (AM, DP), pp. 101–110.

PEPM-2010-BrownT #clone detection #detection #haskell

Clone detection and elimination for Haskell (CB, SJT), pp. 111–120.

PEPM-2010-HoldermansH #strict

Making “stricterness” more relevant (SH, JH), pp. 121–130.

PEPM-2010-LakhotiaBSM #analysis #bytecode #obfuscation

Context-sensitive analysis of obfuscated x86 executables (AL, DRB, AS, AM), pp. 131–140.

PEPM-2010-LiO #automaton

Conditional weighted pushdown systems and applications (XL, MO), pp. 141–150.

PEPM-2010-Miljenovic

The SourceGraph program (ILM), pp. 151–154.

PEPM-2010-Haftmann #haskell #higher-order #logic

From higher-order logic to Haskell: there and back again (FH), pp. 155–158.