for "garbage" and "collection" and "1986"
Search term: garbage;collection;1986
No spelling errors allowed, case-insensitive, partial words match.
Information on how to form queries.
@TechReport{Stam86,
author = "James William Stamos",
title = "Programmer-Invoked Local Garbage Collection: {A}
Design",
type = "Technical Report",
number = "unpublished draft",
institution = "Massachusetts Institute of Technology",
year = "1986",
}
@Article{KAMASH155IJPP86,
author = "Khayri A. M. Ali and Seif Haridi",
title = "Global Garbage collection for Distributed Storage
Systems",
journal = "International Journal of Parallel Programming",
year = "1986",
month = oct,
volume = "15",
number = "5",
pages = "339--387",
}
@TechReport{WITRUManchester86,
author = "I. Watson",
title = "An Analysis of Garbage collection for Distributed
Systems",
type = "Technical Report",
institution = "University of Manchester Dept. of Computer Science",
address = "Manchester, United Kingdom",
year = "1986",
}
@Book{Fasel86,
editor = "J. H. Fasel and R. M. Keller",
title = "Graph Reduction",
series = "LNCS",
volume = "279",
publisher = "Springer Verlag",
month = sep,
year = "1986",
keywords = "FP, LNCS, 279, functional, applicative, programming,
implementation, combinator, ski",
abstract = "RMIT library has a copy 1 H.-G. Oberhauser. On the
correspondence of lambda style reduction and combinator
style reduction. 26 K. Berkling Head order reduction: a
graph reduction scheme for the operational lambda
calculus 49 J. Fairbairn A simple abstract machine to
execute supercombinators 53 J. Goguen, C. Kirchner, J.
Meseguer Concurrent term rewriting as a model of
computation 94 B. Goldberg, P. Hudak Alfalfa:
distributed graph reduction on a hypercube
multiprocessor 114 R. Michelson at al. Prallel graph
reduction on a supercomputer 119 T. Johnsson Target
code generation from G-machine code 160 M. Castan et al
Towards the design of a parallel graph reduction
machine: the MaRS project 181 P. G. Harrison, M. J.
Reeve The parallel graph reduction machine Alice 203 R.
M. Keller et al Overview of Rediflow II development 215
M.C.J.D. van Eekelen, M. J. Plasmeijer Specification of
reduction strategies in term rewriting systems 240 F.
W. Burton Controlling reduction partial order in
functional parallel programs 252 A. Deb Parallel
garbage collection for graph machines 265 I. Watson, P.
Watson Graph reduction in a parallel virtual memory
environment 275 R. B. Kieburtz Performance measurement
of a G-machine implementation 297 S. Tighe et al A
flexible architectural study methodology 312 P. Hudak
Arrays, non-determinism, side-effects and parallelism:
a functional perspective 328 P. Wadler A new array
operation 336 Arvind, R. S. Nikhil, K. K. Pingali
I-structures: data structures for parallel computing
370 B. Jayaraman, G. Gupta Parallel execution of an
equational language 382 G. Lindstrom Implementing
logical variables on a graph reduction architecture 401
U. S. Reddy Functional logic languages part 1 426 J.
Staples, P. J. Robinson Unification of quantified
terms",
note = "Proc. Workshop on Graph Reduction, Santa Fe, New
Mexico, USA",
}
@Proceedings{ACM86,
title = "{ACM} Conference on Lisp and Functional Programming",
publisher = "ACM",
month = aug,
year = "1986",
keywords = "FP, lfp, slfp, lfp86, slfp86",
abstract = "CSci has a copy 1 S. Thompson. Laws in Miranda 13 D.
Clement, et al. A simple applicative language: mini ML
28 D. K. Gifford, J. M. Lucassen. Integrating
functional and imperative programming 39 C. N. Alberga
et al. Experience with an uncommon lisp 54 J. Padget.
Desiderata for the standardisation of lisp 67 R. A.
Brooks et al. Design of an optimising dynamically
retargetable compiler for common lisp 86 D. H. Bartley,
J. C., Jensen. The implementation of PC scheme 94 J.
Fairbairn, S. C. Wray. Code generation techniques for
functional languages 105 T. Knight. An architecture for
mostly functional languages. (Symbolics) 113 M.
Lemaitre et al. Mechanisms for efficient multiprocessor
combinator reduction. 122 J. D. Ramsdell. The Curry
chip 132 A. Bloss, P. Hudak. Variations on strictness
analysis 143 R. Kent et al. Expansion passing style:
beyond conventional macros 151 E. Kohlbecker et al.
Hygenic macro expansion 162 H-J. Boehm et al. Exact
real arithmetic: a case study in higher order
programming 174 J. L. White. Reconfigurable,
retargetable bignums: a case study in efficient
portable lisp system building 192 P. Steenkiste, J.
Hennessy. Lisp on a reduced instruction set processor
202 V. Sarkar, J. Hennessey. Partitioning parallel
programs for macro dataflow 212 M. Scheevel. Norma: a
graph reduction processor 220 C. Clack, S.L.
Peyton-Jones. The four-stroke reduction engine 233 P.
Lee, U. Pleban. On the use of Lisp in implementing
denotational semantics 249 H. R. Nielson, F. Nielson.
Semantics directed compiling for functional languages
258 A. Bawden. Connection graphs 266 M. Mauny, A.
Suarez. Implementing functional languages on the
categorical abstract machine 279 G. L. Steele, W. D.
Hillis. Connection machine lisp: fine grained parallel
symbolic processing 298 M. Wand, D. P. Friedman. The
mystery of the tower revealed: a non-reflective tower.
308 J. C. Mitchell. A type-inference approach to
reduction properties and semantics of polymorphic
expressions. 320 B. Jayaraman et al. Equations, sets
and reduction semantics for functional and logic
programming. 322 S. R. Thatte. Towards a semantic
theory for equational programming languages. 343 C-W.
Lerman, D. Maurer. A protocol for distributed reference
counting 351 P. Hudak. A semantic model of reference
counting and its abstraction 364 M. Rudalics.
Distributed copying garbage collection.",
}
@TechReport{Watson86,
author = "P. Watson",
title = "The parallel reduction of lambda calculus
expressions.",
institution = "Dept. Computer Science, University of Manchester",
number = "UMCS-87-2-1",
month = jul,
year = "1986",
keywords = "PhD thesis, parallel, evaluation, execution,
functional, applicative, programming, FP, graph
reduction, beta conversion, garbage collection",
}
@InCollection{Glaser86,
author = "H. Glaser and S. Hayes",
title = "Another Implementation Technique for Applicative
Languages",
booktitle = "ESOP 86",
pages = "70--81",
publisher = "Springer-Verlag",
address = "Berlin, DE",
year = "1986",
keywords = "functional dataflow",
ISBN = "3-540-16442-1",
abstract = "This paper presents a particularly simple data flow
model which is similar to supercombinator reduction,
supporting higher order functions, garbage collection
and a form of lazy evaluation in a clear and natural
manner.",
note = "Lecture Notes in Computer Science 213",
}
@InProceedings{Ruda86,
author = "Martin Rudalics",
title = "{Distributed Copying Garbage Collection}",
booktitle = "{1986 ACM Conference on LISP and Functional
Programming}",
year = "1986",
pages = "364--372",
publisher = "ACM, order no. 552860",
address = "Cambridge, USA, August 4--6",
note = "Also: Technical Report 86-14, RISC-Linz, Johannes
Kepler University, Linz, Austria, 1986",
}
@Article{STROM86,
key = "Strom \& Yemini",
author = "R. E. Strom and S. Yemini",
title = "Typestate: {A} Programming Language Concept for
Enhancing Software Reliability",
journal = "tose",
publisher = "ieee",
volume = "SE-12",
number = "1",
month = jan,
year = "1986",
pages = "157--171",
keywords = "Program analysis; program verification; security;
software reliability; type checking; typestate",
abstract = "We introduce a new programming language concept called
typestate, which is a refinement of the concept of
type. Whereas the type of a data object determines the
set of operations ever permitted on the object,
typestate determines the subset of these operations
which is permitted in a particular context. Typestate
tracking is a program analysis technique which enhances
program reliability by detecting at compile-time
syntactically legal but semantically undefined
execution sequences. These include, for example,
reading a variable before it has been initialized,
dereferencing a pointer after the dynamic object has
been deallocated, etc. Typestate tracking detects
errors that cannot be detected by type checking or by
conventional static scope rules. Additionally,
typestate tracking makes it possible for compilers to
insert appropriate finalization of data at exception
points and on program termination, eliminating the need
to support finalization by means of either garbage
collection or unsafe deallocation operations such as
Pascal's dispose operation. By enforcing typestate
invariants at compile-time, it becomes practical to
implement a ``secure language''- that is, on in which
all successfully compiled program modules have fully
defined execution-time effects, and the only effects of
program errors are incorrect output values. This paper
defines typestate, gives examples of its application,
and shows how typestate checking may be embedded into a
compiler. We discuss the consequences of typestate
checking for software reliability and software
structure, and conclude with a discussion of our
experience using a high-level language incorporating
typestate checking.",
bibdate = "Fri Aug 21 14:26:38 1987",
owner = "manning",
}
Found 9 references in 5 bibliographies.
You used 19 seconds of our CPU time.