| Record ID | marc_columbia/Columbia-extract-20221130-003.mrc:307802055:1306 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-003.mrc:307802055:1306?format=raw |
LEADER: 01306fam a2200361 a 4500
001 1357534
005 20220602014838.0
008 930125s1993 mau b 001 0 eng
010 $a 93000281
020 $a0817636544 (Boston : acid-free)
020 $a3764336544 (Basel : acid-free)
035 $a(OCoLC)27429800
035 $a(OCoLC)ocm27429800
035 $9AHK6836CU
035 $a(NNC)1357534
035 $a1357534
040 $aDLC$cDLC$dNNC
050 00 $aQA267.3$b.C87 1993
082 00 $a005.13/1$220
100 1 $aCurien, P.-L.$q(Pierre-Louis)$0http://id.loc.gov/authorities/names/n85184805
245 10 $aCategorical combinators, sequential algorithms, and functional programming /$cPierre-Louis Curien.
250 $a2nd ed.
260 $aBoston :$bBirkhäuser,$c1993.
263 $a9304
300 $axx, 403 pages ;$c25 cm.
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
490 1 $aProgress in theoretical computer science
504 $aIncludes bibliographical references (p. 381-394) and indexes.
650 0 $aFormal languages.$0http://id.loc.gov/authorities/subjects/sh85050802
830 0 $aProgress in theoretical computer science.$0http://id.loc.gov/authorities/names/n91020051
852 00 $boff,eng$hQA267.3$i.C87 1993