The following pages link to Journal of Functional Programming (Q2713363):
Displayed 50 items.
- Automatic useless-code elimination for HOT functional programs (Q2713364) (← links)
- Compilation of a specialized functional language for massively parallel computers (Q2713366) (← links)
- An adequate and efficient left-associated binary numeral system in the λ-calculus (Q2713367) (← links)
- A functional reactive animation of a lift using Fran (Q2730075) (← links)
- From Polyvariant flow information to intersection and union types (Q2732171) (← links)
- Set constraints for destructive array update optimization (Q2732172) (← links)
- FUNCTIONAL PEARL <i>Unfolding pointer algorithms</i> (Q2732173) (← links)
- Automated complexity analysis of Nuprl extracted programs (Q2740983) (← links)
- Algorithms with polynomial interpretation termination proof (Q2740985) (← links)
- The expressive power of higher-order types or, life without CONS (Q2740986) (← links)
- A predicative approach to the classification problem (Q2740987) (← links)
- On characterizations of the basic feasible functionals, Part I (Q2740989) (← links)
- Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence (Q2757080) (← links)
- Exceptional syntax (Q2757081) (← links)
- Maximum marking problems (Q2757082) (← links)
- Red-black trees with types (Q2757083) (← links)
- Persistent triangulations (Q2757100) (← links)
- Inductive graphs and functional graph algorithms (Q2757101) (← links)
- Manufacturing datatypes (Q2757102) (← links)
- Inductive benchmarking for purely functional data structures (Q2757104) (← links)
- Modular lazy search for Constraint Satisfaction Problems (Q2757107) (← links)
- A predicative analysis of structural recursion (Q2784165) (← links)
- Stack-based typed assembly language (Q2784166) (← links)
- Proofs for free (Q2844694) (← links)
- Pure Type System conversion is always typable (Q2844696) (← links)
- Macros that Work Together (Q2844698) (← links)
- Fractal image compression (Q2875220) (← links)
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
- Commercial users of functional programming workshop report (Q2875222) (← links)
- Delimited control and computational effects (Q2875223) (← links)
- Implicit self-adjusting computation for purely functional programs (Q2875225) (← links)
- Work it, wrap it, fix it, fold it (Q2875226) (← links)
- Special Issue Dedicated to ICFP 2012: Editorial (Q2875227) (← links)
- Elaborating intersection and union types (Q2875228) (← links)
- On the complexity of stream equality (Q2875229) (← links)
- Pushdown flow analysis with abstract garbage collection (Q2875231) (← links)
- Proof-producing translation of higher-order logic into pure and stateful ML (Q2875232) (← links)
- Transporting functions across ornaments (Q2875233) (← links)
- Propositions as sessions (Q2875234) (← links)
- A note on the genuine Sieve of Eratosthenes (Q2913924) (← links)
- Sorted (Q2913925) (← links)
- Embedding an interpreted language using higher-order functions and types (Q2913927) (← links)
- Shifting the stage (Q2913928) (← links)
- A compiled implementation of normalisation by evaluation (Q2913943) (← links)
- Semantic subtyping with an SMT solver (Q2913944) (← links)
- Deletion: The curse of the red-black tree (Q2933113) (← links)
- Computational Semantics with Functional Programming, by Jan van Eijck and Christina Unger . (Q2933114) (← links)
- Typed quote/antiquote or: Compile-time parsing (Q3016212) (← links)
- Structural recursion with locally scoped names (Q3016213) (← links)
- Balancing weight-balanced trees (Q3016214) (← links)