Typed scheme: From scripts to programs (2010)

by Sam Tobin-Hochstadt
Citations:3 - 1 self

Documents Related by Co-Citation

13 An applicative random-access stack – Eugene W. Myers - 1983
2 Fast And Space Efficient Trie Searches – Phil Bagwell - 2000
4 Component Deployment with PLaneT: You Want it Where – Jacob Matthews - 2006
1 Scheme Utilities, version 7. PLaneT Package Repository – Carl Eastlund - 2010
1 http://clojure.org Haim Kaplan and Robert E. Tarjan. Persistent lists with catenation via recursive slow-down – Clojure - 1995
1 version 4.2. PLaneT Package Repository – Galore - 2009
1 RaList: Purely Functional Random-Access Lists, version 2.3. PLaneT Package Repository – David Van Horn - 2010
48 The pairing heap: A new form of self-adjusting heap – M L Fredman, R Sedgewick, D D Sleator, R E Tarjan - 1986
7 Practical Variable-Arity Polymorphism – T S Strickland, S Tobin-Hochstadt, M Felleisen - 2009
64 The design and implementation of typed scheme – S Tobin-Hochstadt, M Felleisen - 2008
166 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
7 Fast Functional Lists, Hash-Lists, Deques and Variable Length Arrays – Phil Bagwell - 2002
373 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
228 Functional Data Structures – Chris Okasaki - 1996
2 The Black-White Bakery Algorithm and related bounded-space, adaptive, local-spinning and FIFO algorithms – Gadi Taubenfeld
23 Mutual exclusion using indivisible reads and writes – J Burns, N A Lynch - 1980
6 Algorithmes du parallèlisme, le problème de l’exclusion mutuelle. Dunod informatique – Michel Raynal - 1990
52 Ts: an optimizing compiler for smalltalk – R E Johnson, J O Graver, L W Zurawski - 1988
35 Type-checking smalltalk – R E Johnson - 1986