Martin Hofmann  Home/Search
Context
Related
| dcs.ed.ac.uk/home/mxh/malloc.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.ed.ac.uk/home/mxh/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper is to show that by imposing mild extra annotations one can have the best of both worlds: easy to write code which is amenable to equational reasoning, yet modifies its arguments in place and does not allocate heap space unless explicitly told to do so. An aside: a critic may argue that a skilled programmer would write the corresponding C code in the same time if not faster than the functional code. I would like to compare this with doing lengthy arithmetic or algebraic calculations... (Update)
Similar documents (at the sentence level):
38.6%: A Type System for Bounded Space and Functional in-Place Update - Hofmann (2000) (Correct)
37.2%: A type system for bounded space and functional in-place update.. - Hofmann (2000) (Correct)
Active bibliography (related documents): More All
0.2: Quasi-Linear Types - Kobayashi (1999) (Correct)
0.2: How to Declare an Imperative - Wadler (1995) (Correct)
0.1: Alias Killing: Unique Variables Without Destructive Reads - Boyland (1999) (Correct)
Similar documents based on text: More All
0.3: Heap Bounded Assembly Language - Aspinall, Compagnoni (2003) (Correct)
0.2: Another Type System for in-Place Update - David Aspinall And (2002) (Correct)
0.2: Linear Types and Non-Size-Increasing Polynomial Time Computation - Hofmann (1998) (Correct)
BibTeX entry: (Update)
@misc{ hofmann-place,
author = "Martin Hofmann",
title = "In-place update with linear types or How to compile functional programs
into malloc()-free C",
url = "citeseer.ist.psu.edu/236176.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard, Scedrov et al. - 1992
233 Computational interpretations of linear logic - Abramsky - 1993
215 Theoretical Computer Science (context) - Lafont, abstract - 1988
188 Region-based memory management - Tofte, Talpin - 1997
132 Syntactic control of interference (context) - Reynolds - 1978
58 Linear types and non size-increasing polynomial time computa.. - Hofmann - 1999
51 Operational aspects of linear lambda calculus - Lincoln, Mitchell - 1992
37 Recursion and dynamic data structures in bounded space: towa.. - Hughes, Pareto - 1999
36 ACM Transactions on Programming Languages and Systems (context) - Tofte, Birkedal et al. - 1998
35 Reference counting as a computational interpretation of line.. - Chirimar, Gunter et al. - 1995
34 Uniqueness typing for functional languages with graph rewrit.. - Barendsen, Smetsers - 1996
29 Syntactic control of interference revisited - O'Hearn, Takeyama et al. - 1995
25 Operational interpretations of linear logic - Turner, Wadler - 1999
24 documentation and user's guide (context) - Leroy, Caml - 1999
21 A linear functional language (context) - Holmstrom - 1988
15 Lively Linear LISP---Look Ma (context) - Baker - 1992
9 Equations for Defining Poly-time Functions (context) - Caseiro - 1997
6 A Linear Logic Quicksort - Baker - 1994
6 Rolling your own mutable adt --- a connection between linear.. - Hudak, Chen - 1997
Documents on the same site (http://www.dcs.ed.ac.uk/home/mxh/papers.html): More
A Simple Model for Quotient Types - Hofmann (1995) (Correct)
Type Systems For Polynomial-Time Computation - Hofmann (1998) (Correct)
On the Interpretation of Type Theory in Locally Cartesian Closed.. - Hofmann (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC