## John H. Reppy, Julia L. Lawall

*Proceedings of the 11th International Conference on Functional Programming*

ICFP, 2006.

@proceedings{ICFP-2006, address = "Portland, Oregon, USA", editor = "John H. Reppy and Julia L. Lawall", isbn = "1-59593-309-3", publisher = "{ACM}", title = "{Proceedings of the 11th International Conference on Functional Programming}", year = 2006, }

### Contents (27 items)

- ICFP-2006-Dybvig #development
- The development of Chez Scheme (RKD), pp. 1–12.
- ICFP-2006-MightS #analysis #garbage collection
- Improving flow analyses via ΓCFA: abstract garbage collection and counting (MM, OS), pp. 13–25.
- ICFP-2006-KiselyovSS
- Delimited dynamic binding (OK, CcS, AS), pp. 26–37.
- ICFP-2006-WalkerMLRA #static typing #type system #λ-calculus
- Static typing for a faulty λ calculus (DW, LWM, JL, GAR, DIA), pp. 38–49.
- ICFP-2006-JonesVWW #data type #type inference
- Simple unification-based type inference for GADTs (SLPJ, DV, SW, GW), pp. 50–61.
- ICFP-2006-NanevskiMB #hoare #morphism #polymorphism #type system
- Polymorphism and separation in hoare type theory (AN, GM, LB), pp. 62–73.
- ICFP-2006-NakataG #programming #recursion
- Recursive modules for programming (KN, JG), pp. 74–86.
- ICFP-2006-OwensF
- From structures and functors to modules and units (SO, MF), pp. 87–98.
- ICFP-2006-Rossberg #component #ml
- The missing link: dynamic components for ML (AR), pp. 99–110.
- ICFP-2006-FisherS #static analysis #syntax
- Static analysis for syntax objects (DF, OS), pp. 111–121.
- ICFP-2006-Shapiro #concurrent #proving #source code
- Practical proofs of concurrent programs (MS), p. 123.
- ICFP-2006-DonnellyF #transaction
- Transactional events (KD, MF), pp. 124–135.
- ICFP-2006-ZiarekSJ #abstraction #composition #concurrent #functional #named #source code
- Stabilizers: a modular checkpointing abstraction for concurrent functional programs (LZ, PS, SJ), pp. 136–147.
- ICFP-2006-DowseB #concurrent #modelling
- Modelling deterministic concurrent I/O (MD, AB), pp. 148–159.
- ICFP-2006-Chlipala #composition #development #proving #verification
- Modular development of certified program verifiers with a proof assistant (AC), pp. 160–171.
- ICFP-2006-HickeyNYK #hybrid #representation #using
- Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection (JH, AN, XY, AK), pp. 172–183.
- ICFP-2006-Rosu #problem #similarity
- Equality of streams is a Pi0 over 2-complete problem (GR), pp. 184–191.
- ICFP-2006-Frisch #ml
- OCaml + XDuce (AF), pp. 192–200.
- ICFP-2006-KawanakaH #bidirectional #model transformation #named #transformation language #xml
- biXid: a bidirectional transformation language for XML (SK, HH), pp. 201–214.
- ICFP-2006-Bird #functional
- Fifteen years of functional pearls (RSB), p. 215.
- ICFP-2006-BringertR #composition
- A pattern for almost compositional functions (BB, AR), pp. 216–226.
- ICFP-2006-KatsumataN #algebra #parametricity
- Algebraic fusion of functions with an accumulating parameter and its improvement (SyK, SN), pp. 227–238.
- ICFP-2006-BlumeAC #programming
- Extensible programming with first-class cases (MB, UAA, WC), pp. 239–250.
- ICFP-2006-VytiniotisWJ #rank
- Boxy types: inference for higher-rank types and impredicativity (DV, SW, SLPJ), pp. 251–262.
- ICFP-2006-Abadi #calculus #data access #dependence
- Access control in a core calculus of dependency (MA), pp. 263–273.
- ICFP-2006-Lin #monad #programming
- Programming monads operationally with Unimo (CKL), pp. 274–285.
- ICFP-2006-DenielouL #abstraction #distributed #type system
- Abstraction preservation and subtyping in distributed languages (PMD, JJL), pp. 286–297.

3 ×#composition

3 ×#concurrent

3 ×#programming

3 ×#type system

2 ×#abstraction

2 ×#development

2 ×#functional

2 ×#ml

2 ×#named

2 ×#proving

3 ×#concurrent

3 ×#programming

3 ×#type system

2 ×#abstraction

2 ×#development

2 ×#functional

2 ×#ml

2 ×#named

2 ×#proving