MARC record from Internet Archive

LEADER: 06707cam 2200877 a 4500
001 ocm16919650
003 OCoLC
005 20211222114113.0
008 881017s1987 gw a b 100 0 eng
006 m d
007 cr unu|uuuuu||
010 $a 88126507
040 $aDLC$beng$cDLC$dMUQ$dBTCTA$dBAKER$dYDXCP$dUPM$dGBVCP$dUAB$dHEBIS$dZWZ$dTFW$dBDX$dOCLCF$dOCLCQ$dOCLCO$dOCLCQ$dOCL$dOCLCO$dDEBSZ$dOCLCQ$dCNUTO$dOCLCA$dOCLCQ$dOCLCO$dINT$dCEF$dHUELT$dOCLCQ$dOL$$dKIJ$dOCLCO
015 $a88,A06,0995$2dnb
016 7 $a880089326$2DE-101
019 $a70786219$a190830243$a811367776$a977756013$a978868199$a986565322$a988646821$a994602886$a1004696400$a1011828016$a1013225319$a1016236572$a1049777368$a1051314532$a1052934858$a1091361556$a1101996471$a1107128563$a1160885577$a1170864624$a1191314653$a1200928643$a1227834698
020 $a0387184201$q(U.S. ;$qpbk.)
020 $a9780387184203$q(U.S. ;$qpbk.)
020 $a3540184201
020 $a9783540184201
020 $z0387148201
035 $a(OCoLC)16919650$z(OCoLC)70786219$z(OCoLC)190830243$z(OCoLC)811367776$z(OCoLC)977756013$z(OCoLC)978868199$z(OCoLC)986565322$z(OCoLC)988646821$z(OCoLC)994602886$z(OCoLC)1004696400$z(OCoLC)1011828016$z(OCoLC)1013225319$z(OCoLC)1016236572$z(OCoLC)1049777368$z(OCoLC)1051314532$z(OCoLC)1052934858$z(OCoLC)1091361556$z(OCoLC)1101996471$z(OCoLC)1107128563$z(OCoLC)1160885577$z(OCoLC)1170864624$z(OCoLC)1191314653$z(OCoLC)1200928643$z(OCoLC)1227834698
050 00 $aQA76.6$b.G733 1987
055 3 $aQA166$bG748 1987
082 00 $a511/.5$219
084 $a31.80$2bcl
084 $a*00B25$2msc
084 $a68-06$2msc
084 $a28$2sdnb
245 00 $aGraph reduction :$bproceedings of a workshop, Santa Fé, New Mexico, USA, September 29-October 1, 1986 /$cJoseph H. Fasel, Robert M. Keller (eds.).
260 $aBerlin ;$aNew York :$bSpringer-Verlag,$c©1987.
300 $axvi, 450 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aLecture notes in computer science ;$v279
500 $a"Sponsored by the Los Alamos National Laboratory of the University of California and Microelectronics and Computer Technology Corporation (MCC)"--Preface.
504 $aIncludes bibliographical references.
530 $aSome issues available on the Internet. Access restricted to members of the Tufts University community.
538 $aMode of access: World Wide Web.
505 0 $aOn the correspondence of lambda style reduction and combinator style reduction -- Head order reduction: A graph reduction scheme for the operational lambda calculus -- A simple abstract machine to execute supercombinators -- Concurrent term rewriting as a model of computation -- Alfalfa: Distributed graph reduction on a hypercube multiprocessor -- Parallel graph reduction on a supercomputer: A status report -- Target code generation from G-machine code -- Toward the design of a parallel graph reduction machine the MaRS project -- The parallel graph reduction machine, ALICE -- Overview of Rediflow II development -- Specification of reduction strategies in term rewriting systems -- Controlling reduction partial order in functional parallel programs -- Parallel garbage collection for graph machines -- Graph reduction in a parallel virtual memory environment -- Performance measurement of a G-machine implementation -- A flexible architectural study methodology -- Arrays, non-determinism, side-effects, and parallelism: A functional perspective -- A new array operation -- I-Structures: Data structures for parallel computing -- Parallel execution of an equational language -- Implementing logical variables on a graph reduction architecture -- Functional logic languages part I -- Unification of quantified terms.
520 $aThis volume describes recent research in graph reduction and related areas of functional and logic programming, as reported at a workshop in 1986. The papers are based on the presentations, and because the final versions were prepared after the workshop, they reflect some of the discussions as well. Some benefits of graph reduction can be found in these papers: - A mathematically elegant denotational semantics - Lazy evaluation, which avoids recomputation and makes programming with infinite data structures (such as streams) possible - A natural tasking model for fine-to-medium grain parallelism. The major topics covered are computational models for graph reduction, implementation of graph reduction on conventional architectures, specialized graph reduction architectures, resource control issues such as control of reduction order and garbage collection, performance modelling and simulation, treatment of arrays, and the relationship of graph reduction to logic programming.
650 0 $aFunctional programming languages$vCongresses.
650 0 $aGraph grammars$vCongresses.
650 0 $aComputer architecture$vCongresses.
650 6 $aLangages de programmation fonctionnels$xCongrès.
650 6 $aGrammaires de graphes$xCongrès.
650 6 $aOrdinateurs$xArchitecture$vCongrès.
650 7 $aComputer architecture.$2fast$0(OCoLC)fst00872026
650 7 $aFunctional programming languages.$2fast$0(OCoLC)fst00936087
650 7 $aGraph grammars.$2fast$0(OCoLC)fst00946582
650 7 $aGraphenreduktion$2gnd
651 7 $aSanta Fé <NM, 1986>$2swd
655 4 $aElectronic resources (Books)
655 7 $aConference papers and proceedings.$2fast$0(OCoLC)fst01423772
700 1 $aFasel, Joseph H.
700 1 $aKeller, Robert M.
710 2 $aLos Alamos Scientific Laboratory.
710 2 $aMicroelectronics and Computer Technology Corporation.
830 0 $aLecture notes in computer science ;$v279.
856 41 $3(n.149, 1983 - current) available via SpringerLink$uhttp://www.library.tufts.edu/ezproxy/ezproxy.asp?LOCATION=SpLinkLeNoCoSc
856 41 $3Table of contents$uhttp://www.gbv.de/dms/bowker/toc/9783540184201.pdf
856 42 $uhttp://www.zentralblatt-math.org/zmath/en/search/?an=0632.00017$3Inhaltstext
856 4 $3Cover$uhttp://swbplus.bsz-bw.de/bsz013335499cov.htm$v20150910142158
938 $aBaker & Taylor$bBKTY$c74.95$d74.95$i0387184201$n0001281370$sactive
938 $aBrodart$bBROD$n38795841$c$34.60
938 $aBaker and Taylor$bBTCP$n88126507
938 $aYBP Library Services$bYANK$n3660238
029 1 $aAU@$b000005724788
029 1 $aDEBSZ$b013335499
029 1 $aGBVCP$b024098361
029 1 $aHEBIS$b01001005X
029 1 $aNLGGC$b042180031
029 1 $aNZ1$b3247782
994 $aZ0$bP4A
948 $hHELD BY P4A - 247 OTHER HOLDINGS