Matthias Blume, Naoki Kobayashi, Germán Vidal
Proceedings of the 10th International Symposium on Functional and Logic Programming
FLOPS, 2010.

@proceedings{FLOPS-2010,
	address       = "Sendai, Japan",
	doi           = "10.1007/978-3-642-12251-4",
	editor        = "Matthias Blume and Naoki Kobayashi and Germán Vidal",
	isbn          = "978-3-642-12250-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 10th International Symposium on Functional and Logic Programming}",
	volume        = 6009,
	year          = 2010,
}

Contents (24 items)

3 ×#constraints
3 ×#generative
3 ×#term rewriting
2 ×#automation
2 ×#dependent type
2 ×#evaluation
2 ×#named
2 ×#normalisation
2 ×#satisfiability
2 ×#using

FLOPS-2010-Pientka #dependent type #named #programming

Beluga: Programming with Dependent Types, Contextual Data, and Contexts (BP), pp. 1–12.

FLOPS-2010-Sagonas #concurrent #detection #erlang #fault #source code #static analysis #using

Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs (KFS), pp. 13–18.

FLOPS-2010-TamuraTB #constraints #problem #satisfiability

Solving Constraint Satisfaction Problems with SAT Technology (NT, TT, MB), pp. 19–23.

FLOPS-2010-RemyY

A Church-Style Intermediate Language for MLF (DR, BY), pp. 24–39.

FLOPS-2010-AltenkirchDLO #dependent type #named

ΠΣ: Dependent Types without the Sugar (TA, NAD, AL, NO), pp. 40–55.

FLOPS-2010-OrchardS #constraints #haskell

Haskell Type Constraints Unleashed (DAO, TS), pp. 56–71.

FLOPS-2010-BartheBK #framework #functional

A Functional Framework for Result Checking (GB, PB, CK), pp. 72–86.

FLOPS-2010-ThiemannS #combinator #generative #polymorphism

Tag-Free Combinators for Binding-Time Polymorphic Program Generation (PT, MS), pp. 87–102.

FLOPS-2010-HaftmannN #code generation #higher-order #term rewriting

Code Generation via Higher-Order Rewrite Systems (FH, TN), pp. 103–117.

FLOPS-2010-AlvezL #axiom #similarity #strict

A Complete Axiomatization of Strict Equality (JÁ, FJLF), pp. 118–133.

FLOPS-2010-Saurin #standard #λ-calculus #μ-calculus

Standardization and Böhm Trees for λμ-Calculus (AS), pp. 134–149.

FLOPS-2010-EstruchFHR #distance

An Integrated Distance for Atoms (VE, CF, JHO, MJRQ), pp. 150–164.

FLOPS-2010-HoweK #prolog #satisfiability

A Pearl on SAT Solving in Prolog (JMH, AK), pp. 165–174.

FLOPS-2010-SeidelV #automation #generative #theorem

Automatically Generating Counterexamples to Naive Free Theorems (DS, JV), pp. 175–190.

FLOPS-2010-CaballeroGS #constraints #generative #logic programming #sql #testing

Applying Constraint Logic Programming to SQL Test Case Generation (RC, YGR, FSP), pp. 191–206.

FLOPS-2010-BerardiT #compilation #decompiler #normalisation

Internal Normalization, Compilation and Decompilation for System Fbh (SB, MT), pp. 207–223.

FLOPS-2010-Abel #calculus #evaluation #normalisation #towards

Towards Normalization by Evaluation for the βη-Calculus of Constructions (AA), pp. 224–239.

FLOPS-2010-DanvyMMZ #call-by #evaluation

Defunctionalized Interpreters for Call-by-Need Evaluation (OD, KM, JM, IZ), pp. 240–256.

FLOPS-2010-AvanziniM #analysis #complexity #graph grammar

Complexity Analysis by Graph Rewriting (MA, GM), pp. 257–271.

FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus

Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.

FLOPS-2010-NishidaS #injection #proving #term rewriting

Proving Injectivity of Functions via Program Inversion in Term Rewriting (NN, MS), pp. 288–303.

FLOPS-2010-Kiselyov #ml

Delimited Control in OCaml, Abstractly and Concretely: System Description (OK), pp. 304–320.

FLOPS-2010-MorihataM #automation #parallel #quantifier #recursion #using

Automatic Parallelization of Recursive Functions Using Quantifier Elimination (AM, KM), pp. 321–336.

FLOPS-2010-DieterleBL #distributed

A Skeleton for Distributed Work Pools in Eden (MD, JB, RL), pp. 337–353.