M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Using Ambients to Control Resources - Teller, Zimmer, Hirschkoff (2002) (32 citations) (Correct)
....has been designed specifically for active networks, and also handles some form of resource bounds. Although Plan accounts for both releasable (space, bandwidth) and non releasable (time) resources, it handles neither recursion nor concurrency on one node. A related line of research is followed in [16, 1], where means to guarantee bounds on the time or space consumption required for the execution of (sequential) functions are proposed. These works all focus on resource control; however, none of these approaches can be directly compared to ours. It might be interesting to study if and how our ....
M. Hofmann. The strength of non-size increasing computation. In Proc. 29th ACM Symp. on Principles of Programming Languages (POPL'02), pages 260-- 269. ACM Press, 2002.
Heap Bounded Assembly Language - Aspinall, Compagnoni (2003) (1 citation) (Correct)
....HBAL to allow limited sharing, yet still retain the guarantee on heap boundedness; see Section 5. HBAL s restriction to first order types is also important for guaranteed space bounds, since dealing with higher order types requires storing closures on the heap; however, some recent research in [6] may suggest a way forward here. A major design di#erence between HBAL and previous systems is in the handling of the store. In previous systems, the contents of the store is formalized as part of the static semantics, and the type safety of a program can only be tested once the contents of ....
....consider polymorphic and higher order types as in TAL [9] dependent types as in DTAL [21] and object types. It is a matter for further research to integrate these notions into HBAL, considering the resource usage implications and connection with high level languages. A recent positive result in [6] shows that a large class of functions on lists definable in a system with higher order functions can be computed in bounded space. Different sized diamonds In the high level language LFPL, diamond types are an abstract way of dealing with heap space: one which is consistent with functional ....
Martin Hofmann. The strength of non-size increasing computation. Fachbereich Mathematik, TU Darmstadt, Germany., 2001.
Another Type System for in-Place Update - David Aspinall And (2002) (6 citations) Self-citation (Hofmann) (Correct)
No context found.
Martin Hofmann. The strength of non size-increasing computation. In Proceedings ACM Principles of Programming Languages, 2002.
Static Prediction of Heap Space Usage for First-Order.. - Hofmann, Jost (2003) (10 citations) Self-citation (Hofmann) (Correct)
....like partially applied functions and lambda expressions as in functional programming languages the problem of heap space inference becomes much more complicated as we need to monitor the size of closures which are much more dependent on dynamic aspects. This is discussed in some detail in [9]. We do not see at this point how our work could be extended to cover general higher order functions, not even linear ones. One referee suggested to investigate Reynolds idea of defunctionalisation [17] which eliminates closures in favour of sum types. Again, we leave this to future work. 12. ....
Martin Hofmann. The strength of non size-increasing computation. 2002. Proc. ACM Symp. on Principles of Programming Languages (POPL), Portland, Oregon.
A Calculus of Bounded Capacities - Barbanera, Bugliesi.. (2003) (384 citations) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press.
A Calculus of Bounded Capacities - Barbanera, Bugliesi, al. (2003) (384 citations) (Correct)
No context found.
Hofmann, Martin. (2002). The strength of non size-increasing computation. Pages 260--269 of: Launchbury, John, & Mitchell, John C. (eds), POPL'02. ACM Press.
A Calculus of Bounded Capacities - Barbanera Bugliesi Dezani-Ciancaglini (2003) (384 citations) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press.
A Calculus of Bounded Capacities - Barbanera Bugliesi Dezani-Ciancaglini (2003) (384 citations) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press.
A Functional Scenario for Bytecode Verification of Resource Bounds - Amadio, al. (2004) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In Proc. POPL, ACM Press, 2002.
Resource Control for Synchronous Cooperative Threads - Amadio (2004) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In Proc. POPL, ACM Press, 2002.
Using Ambients to Control Resources - Teller, Zimmer, Hirschkoff (2004) (32 citations) (Correct)
No context found.
Hofmann M (2002) The strength of non-size increasing computation. In: Proceedings of the 29th ACM symposium on principles of programming languages (POPL'02). ACM Press, New York, pp 260--269
A Functional Scenario for Bytecode Verification of.. - Amadio.. (2004) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In Proc. POPL, 2002.
Resource Control for Synchronous Cooperative Threads - Amadio, Zilio (2004) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In Proc. POPL, ACM Press, 2002.
A Calculus of Bounded Capacities - Barbanera Bugliesi Dezani-Ciancaglini (2003) (384 citations) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press.
Using Ambients to Control Resources - Teller, Zimmer, Hirschkoff (2002) (32 citations) (Correct)
No context found.
M. Hofmann. The strength of non-size increasing computation. In Proc. 29th ACM Symp. on Principles of Programming Languages (POPL'02), pages 260--
A Calculus of Bounded Capacities - Barbanera Bugliesi Dezani-Ciancaglini (2003) (384 citations) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press.
A Calculus of Bounded Capacities - Barbanera Bugliesi Dezani-Ciancaglini (2003) (384 citations) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press.
Heap Bounded Assembly Language - Aspinall, Compagnoni (2003) (1 citation) (Correct)
No context found.
Martin Hofmann. The strength of non size-increasing computation. In Proceedings ACM Principles of Programming Languages, 2002.
Short Presentation: A Functional Scenario - For Bytecode Verification (2004) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In Proc. POPL. ACM Press, 2002.
A Calculus of Bounded Capacities - Barbanera, Bugliesi.. (2003) (384 citations) (Correct)
No context found.
M. Hofmann. The strength of non size-increasing computation. In POPL'02, pages 260--269, New York, 2002. ACM Press.
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