ICFP 2014
31 papers
- A relational framework for higher-order shape analysis
- A theory of gradual effect systems
- Behavioral software contracts
- Building embedded systems with embedded DSLs
- Coeffects: a calculus of context-dependent computation
- Compositional semantics for composable continuations: from abortive to delimited control
- Concurrent NetCore: from policies to pipelines
- Depending on types
- Distilling abstract machines
- Folding domain-specific languages: deep and shallow embeddings (functional Pearl)
- Functional programming for dynamic and large data with self-adjusting computation
- Hindley-milner elaboration in applicative style: functional pearl
- Homotopical patch theory
- How to keep your neighbours in order
- Krivine nets: a semantic foundation for distributed execution
- Lem: reusable engineering of real-world semantics
- Maximal sharing in the Lambda calculus with letrec
- On teaching *how to design programs*: observations from a newcomer
- Pattern matching without K
- Practical and effective higher-order optimizations
- Refinement types for Haskell
- Romeo: a system for more flexible binding-safe programming
- SML# in industry: a practical ERP system development
- Safe zero-cost coercions for Haskell
- SeLINQ: tracking information across application-database boundaries
- Settable and non-interfering signal functions for FRP: how a first-order switch is more than enough
- Soft contract verification
- There is no fork: an abstraction for efficient, concurrent, and concise data access
- Type-based parametric analysis of program families
- Using formal methods to enable more secure vehicles: DARPA's HACMS program
- Worker/wrapper/makes it/faster