Manuel M. T. Chakravarty, Zhenjiang Hu, Olivier Danvy
Proceedings of the 16th International Conference on Functional Programming
ICFP, 2011.

@proceedings{ICFP-2011,
	address       = "Tokyo, Japan",
	editor        = "Manuel M. T. Chakravarty and Zhenjiang Hu and Olivier Danvy",
	isbn          = "978-1-4503-0865-6",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 16th International Conference on Functional Programming}",
	year          = 2011,
}

Contents (40 items)

8 ×#functional
6 ×#programming
4 ×#monad
4 ×#semantics
3 ×#ml
3 ×#morphism
3 ×#performance
3 ×#recursion
3 ×#type system
2 ×#composition

ICFP-2011-Filinski #monad #towards

Towards a comprehensive theory of monadic effects (AF), p. 1.

ICFP-2011-GibbonsH #equation #monad #reasoning

Just do it: simple monadic equational reasoning (JG, RH), pp. 2–14.

ICFP-2011-SwamyGLH #lightweight #ml #monad #programming

Lightweight monadic programming in ML (NS, NG, DL, MH), pp. 15–27.

ICFP-2011-Mitchell #ecosystem #functional #modelling #programming

Functional programming through deep time: modeling the first complex ecosystems on earth (EGM), pp. 28–31.

ICFP-2011-SchrijversO #monad #stack

Monads, zippers and views: virtualizing the monad stack (TS, BCdSO), pp. 32–44.

ICFP-2011-KrishnaswamiB #semantics #user interface #visual notation

A semantic model for graphical user interfaces (NRK, NB), pp. 45–57.

ICFP-2011-ShiversT #composition #functional

Modular rollback through control logging: a pair of twin functional pearls (OS, AJT), pp. 58–68.

ICFP-2011-VardoulakisS #analysis #automaton

Pushdown flow analysis of first-class control (DV, OS), pp. 69–80.

ICFP-2011-MaterzokB #continuation #type system

Subtyping delimited continuations (MM, DB), pp. 81–93.

ICFP-2011-CastagnaX #morphism #parametricity #polymorphism #type system

Set-theoretic foundation of parametric polymorphism and subtyping (GC, ZX), pp. 94–106.

ICFP-2011-GesbertGL #logic #morphism #parametricity #polymorphism #semantics #type system

Parametric polymorphism and semantic subtyping: the logical connection (NG, PG, NL), pp. 107–116.

ICFP-2011-MorihataM #functional #parallel #programming

Balanced trees inhabiting functional parallel programming (AM, KM), pp. 117–128.

ICFP-2011-ChenDHA #functional #self #source code

Implicit self-adjusting computation for purely functional programs (YC, JD, MAH, UAA), pp. 129–141.

ICFP-2011-Takeyama #assurance #programming

Programming assurance cases in Agda (MT), p. 142.

ICFP-2011-DevrieseP #on the

On the bright side of type classes: instance arguments in Agda (DD, FP), pp. 143–155.

ICFP-2011-MagalhaesH #case study #experience #functional #modelling

Functional modelling of musical harmony: an experience report (JPM, BdH), pp. 156–162.

ICFP-2011-GonthierZND #ad hoc #automation #how #proving

How to make ad hoc proof automation less ad hoc (GG, BZ, AN, DD), pp. 163–175.

ICFP-2011-DisneyFM #contract #higher-order

Temporal higher-order contracts (TD, CF, JM), pp. 176–188.

ICFP-2011-MightDS #functional #parsing

Parsing with derivatives: a functional pearl (MM, DD, DS), pp. 189–195.

ICFP-2011-UenoOO #functional #garbage collection #performance

An efficient non-moving garbage collector for functional languages (KU, AO, TO), pp. 196–208.

ICFP-2011-GillF #fault #implementation #performance

Deriving an efficient FPGA implementation of a low density parity check forward error corrector (AG, AF), pp. 209–220.

ICFP-2011-GhicaSS #compilation #geometry #hardware #recursion #synthesis

Geometry of synthesis iv: compiling affine recursion into static hardware (DRG, AIS, SS), pp. 221–233.

ICFP-2011-AhnS #combinator #data type #induction #recursion

A hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences (KYA, TS), pp. 234–246.

ICFP-2011-JayP #pattern matching #self

Typed self-interpretation by pattern matching (CBJ, JP), pp. 247–258.

ICFP-2011-ChyzakD #generative #ml #runtime #using #web

Using camlp4 for presenting dynamic mathematics on the web: DynaMoW, an OCaml language extension for the run-time generation of mathematical contents and their presentation on the web (FC, AD), pp. 259–265.

ICFP-2011-SwamyCFSBY #dependent type #distributed #programming

Secure distributed programming with value-dependent types (NS, JC, CF, PYS, KB, JY), pp. 266–278.

ICFP-2011-FosterHFMRSW #named #network #programming language

Frenetic: a network programming language (NF, RH, MJF, CM, JR, AS, DW), pp. 279–291.

ICFP-2011-FisherFWZ #named #programming #tool support

Forest: a language and toolkit for programming with filestores (KF, NF, DW, KQZ), pp. 292–306.

ICFP-2011-OhoriU #database #ml #programming language #standard

Making standard ML a practical database programming language (AO, KU), pp. 307–319.

ICFP-2011-Pouillard

Nameless, painless (NP), pp. 320–332.

ICFP-2011-WeirichYS #bound

Binders unbound (SW, BAY, TS), pp. 333–345.

ICFP-2011-PopescuG #recursion #syntax

Recursion principles for syntax with bindings and substitution (AP, ELG), pp. 346–358.

ICFP-2011-HinzeJ #category theory #fixpoint #proving

Proving the unique fixed-point principle correct: an adventure with category theory (RH, DWHJ), pp. 359–371.

ICFP-2011-GaboardiPP #exclamation #semantics

Linearity and PCF: a semantic insight! (MG, LP, MP), pp. 372–384.

ICFP-2011-MuM #functional #morphism #theorem

Generalising and dualising the third list-homomorphism theorem: functional pearl (SCM, AM), pp. 385–391.

ICFP-2011-WangGW #bidirectional #incremental #performance

Incremental updates for efficient bidirectional transformations (MW, JG, NW), pp. 392–403.

ICFP-2011-GotsmanY #composition #kernel #verification

Modular verification of preemptive OS kernels (AG, HY), pp. 404–417.

ICFP-2011-Chargueraud #imperative #source code #verification

Characteristic formulae for the verification of imperative programs (AC), pp. 418–430.

ICFP-2011-AhmedB #continuation #multi #semantics

An equivalence-preserving CPS translation via multi-language semantics (AA, MB), pp. 431–444.

ICFP-2011-ThamsborgB #logic #program transformation

A kripke logical relation for effect-based program transformations (JT, LB), pp. 445–456.