| Record ID | ia:paragonlanguageu0000sher |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/paragonlanguageu0000sher/paragonlanguageu0000sher_marc.xml |
| Download MARC binary | https://www.archive.org/download/paragonlanguageu0000sher/paragonlanguageu0000sher_meta.mrc |
LEADER: 03901cam 2200793 a 4500
001 ocm11866499
003 OCoLC
005 20191222194011.0
008 850311s1985 gw a b 001 0 eng
010 $a 85004798
040 $aDLC$beng$cDLC$dMUQ$dNLGGC$dC$Q$dYDXCP$dCRU$dGBVCP$dZWZ$dDEBBG$dGW5XE$dTFW$dBDX$dOCLCF$dOCLCO$dGW5XE$dOCLCQ$dCSJ$dOCLCO$dOCLCQ$dXFF$dOCLCQ$dUKMGB$dQGE$dUWO$dCEF$dYOU$dQGE$dOCLCQ$dCWI$dHUELT$dOCLCQ$dOCLCA
015 $a85,A32,0253$2dnb
016 7 $a850636787$2DE-101
016 7 $a005701839$2Uk
019 $a190827272$a811361816$a872327398$a977742117$a986694355$a988647562$a1012038984$a1013224952$a1016346614$a1035090421$a1035300291$a1043978509$a1049733357$a1050119404$a1052940770$a1056270523$a1060757018$a1061493746$a1064286145$a1066827298$a1080691439
020 $a0387152121$q(U.S.)
020 $a9780387152127$q(U.S.)
020 $a3540152121
020 $a9783540152125
020 $z9783540393481$q(electronic bk.)
020 $z354039348X$q(electronic bk.)
035 $a(OCoLC)11866499$z(OCoLC)190827272$z(OCoLC)811361816$z(OCoLC)872327398$z(OCoLC)977742117$z(OCoLC)986694355$z(OCoLC)988647562$z(OCoLC)1012038984$z(OCoLC)1013224952$z(OCoLC)1016346614$z(OCoLC)1035090421$z(OCoLC)1035300291$z(OCoLC)1043978509$z(OCoLC)1049733357$z(OCoLC)1050119404$z(OCoLC)1052940770$z(OCoLC)1056270523$z(OCoLC)1060757018$z(OCoLC)1061493746$z(OCoLC)1064286145$z(OCoLC)1066827298$z(OCoLC)1080691439
050 00 $aQA76.73.P19$bS54 1985
082 00 $a001.64/24$219
084 $a54.53$2bcl
084 $a54.62$2bcl
084 $a28$2sdnb
100 1 $aSherman, Mark Steven.
245 10 $aParagon :$ba language using type hierarchies for the specification, implementation, and selection of abstract data types /$cMark Steven Sherman.
260 $aBerlin ;$aNew York :$bSpringer-Verlag,$c℗♭1985.
300 $aix, 364 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aLecture notes in computer science ;$v189
500 $aBased on the author's thesis (doctoral)--Carnegie-Mellon University, 1983.
500 $aIncludes index.
504 $aIncludes bibliographical references and index.
650 0 $aParagon (Computer program language)
650 0 $aAbstract data types (Computer science)
650 6 $aParagon (Langage de programmation)
650 6 $aTypes abstraits de donne es (Informatique)
650 7 $aAbstract data types (Computer science)$2fast$0(OCoLC)fst00794745
650 7 $aParagon (Computer program language)$2fast$0(OCoLC)fst01052866
650 7 $aAbstrakter Datentyp$2gnd
650 7 $aHierarchie$2gnd
650 7 $aImplementation$2gnd
650 7 $aProgrammiersprache$2gnd
655 4 $aElectronic books.
776 08 $iOnline version:$aSherman, Mark Steven.$tParagon.$dBerlin ; New York : Springer-Verlag, ℗♭1985$z9783540393481$w(OCoLC)560945212
830 0 $aLecture notes in computer science ;$v189.
856 41 $3(n.149, 1983 - current) available via SpringerLink$uhttp://www.library.tufts.edu/ezproxy/ezproxy.asp?LOCATION=SpLinkLeNoCoSc
856 41 $zConnect to Internet resource$xLNCS$uhttp://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=189
856 41 $uhttp://link.springer.com/10.1007/3-540-15212-1$zSpringer Lecture Notes in Computer Science
938 $aBrodart$bBROD$n35917563$c$20.50
938 $aYBP Library Services$bYANK$n318378
029 1 $aAU@$b000003767835
029 1 $aAU@$b000012432422
029 1 $aDEBBG$bBV022167011
029 1 $aDEBSZ$b011965460
029 1 $aGBVCP$b024049786
029 1 $aGEBAY$b402353
029 1 $aHEBIS$b082205086
029 1 $aNLGGC$b851445330
029 1 $aNZ1$b2861164
029 1 $aUKMGB$b005701839
029 1 $aZWZ$b026284308
994 $aZ0$bP4A
948 $hHELD BY P4A - 319 OTHER HOLDINGS