Trends in trends in functional programming 1999/2000 versus 2007/2008
DOI10.1007/S10990-011-9074-ZzbMATH Open1256.68028OpenAlexW2090467396MaRDI QIDQ1929344FDOQ1929344
Authors: Peter Achten, Marko van Eekelen, Pieter Koopman, Marco T. Morazán 
Publication date: 8 January 2013
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-011-9074-z
Recommendations
Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- A theory of type polymorphism in programming
- Title not available (Why is that?)
- Use Cases for Refactoring in Erlang
- Deforestation: Transforming programs to eliminate trees
- Recursive algorithm for computing the frequency response of a class of non-linear difference equation models
- Referential transparency, definiteness and unfoldability
- The Principal Type-Scheme of an Object in Combinatory Logic
- Proving Theorems about LISP Functions
- Deriving a lazy abstract machine
- MULTILISP: a language for concurrent symbolic computation
- Algorithm + strategy = parallelism
- Title not available (Why is that?)
- Compositional explanation of types and algorithmic debugging of type errors
- Scripting the type inference process
- Title not available (Why is that?)
- Parallel functional programming in Eden
- A calculus of functional BSP programs
- Dynamic typing: Syntax and proof theory
- Complete and decidable type inference for GADTs
- Proof Tool Support for Explicit Strictness
- The power of Pi
- Space-efficient gradual typing
- Static prediction of heap space usage for first-order functional programs
- Dynamic typing in polymorphic languages
- An operational semantics for parallel lazy evaluation
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Collected size semantics for strict functional programs over general polymorphic lists
- An Introduction to iTasks: Defining Interactive Work Flows for the Web
- Amortised Memory Analysis Using the Depth of Data Structures
- Algebra of programming in Agda: Dependent types for relational program derivation
- Title not available (Why is that?)
- Fast and loose reasoning is morally correct
- A space consumption analysis by abstract interpretation
Cited In (4)
Uses Software
This page was built for publication: Trends in trends in functional programming 1999/2000 versus 2007/2008
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929344)
