The little typer / (Record no. 73595)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03500nam a2200565 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 8681597 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220712204937.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 190417s2019 mau ob 001 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780262355469 |
| -- | electronic bk. |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.101/5113 |
| 100 1# - AUTHOR NAME | |
| Author | Friedman, Daniel P., |
| 245 14 - TITLE STATEMENT | |
| Title | The little typer / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 1 PDF (424 pages). |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | An introduction to dependent types, demonstrating the most beautiful aspects, one step at a time. A program's type describes its behavior. Dependent types are a first-class part of a language, and are much more powerful than other kinds of types; using just one language for types and programs allows program descriptions to be as powerful as the programs they describe. The Little Typer explains dependent types, beginning with a very small language that looks very much like Scheme and extending it to cover both programming with dependent types and using dependent types for mathematical reasoning. Readers should be familiar with the basics of a Lisp-like programming language, as presented in the first four chapters of The Little Schemer . The first five chapters of The Little Typer provide the needed tools to understand dependent types; the remaining chapters use these tools to build a bridge between mathematics and programming. Readers will learn that tools they know from programming--pairs, lists, functions, and recursion--can also capture patterns of reasoning. The Little Typer does not attempt to teach either practical programming skills or a fully rigorous approach to types. Instead, it demonstrates the most beautiful aspects as simply as possible, one step at a time. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Christiansen, David Thrane, |
| 700 1# - AUTHOR 2 | |
| Author 2 | Bibby, Duane, |
| 700 1# - AUTHOR 2 | |
| Author 2 | Harper, Robert, |
| 700 1# - AUTHOR 2 | |
| Author 2 | McBride, Conor. |
| 856 42 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=8681597 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cambridge : |
| -- | MIT Press, |
| -- | 2018. |
| 264 #2 - | |
| -- | [Piscataqay, New Jersey] : |
| -- | IEEE Xplore, |
| -- | [2019] |
| 336 ## - | |
| -- | text |
| -- | rdacontent |
| 337 ## - | |
| -- | electronic |
| -- | isbdmedia |
| 338 ## - | |
| -- | online resource |
| -- | rdacarrier |
| 588 0# - | |
| -- | Print version record. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Functional programming (Computer science) |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Logic programming. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Type theory. |
| 650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer logic. |
| 650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Functional programming (Computer science) |
| 650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Logic programming. |
| 650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Type theory. |
No items available.