A Loop-detecting Interpreter for Lazy, Higher-order Programs (1992)

Cached

Download Links

by John Hughes , Chalmers Tekniska Hogskola , Alex Ferguson
Venue:Functional Programming, Workshops in Computing
Citations:6 - 0 self

Documents Related by Co-Citation

4 Repr'esentation intentionelle d'algorithmes dans les syst`emes fonctionelles: une 'etude de cas, Th'ese de Doctorat, Universit'e Paris VII – L Colson - 1991
3 Programming with concrete data structures and sequential algorithms, in – G Berry - 1981
4 Une preuve directe du Th'eor`eme d'Ultime Obstination, Comptes Rendus de l'Academie des Sciences – T Coquand - 1992
3 Semantic Frameworks for Complexity, Doctoral Thesis – D J Gurr - 1991
5 The kernel of the applicative language CDS: theory and practice – G Berry, P-L Curien - 1985
11 Towards a theory of parallel algorithms on concrete data structures – Stephen Brookes, Shai Geva - 1990
27 Computational Comonads and Intensional Semantics – Stephen Brookes, Shai Geva - 1991
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
21 About primitive recursive algorithms – L Colson - 1991
40 Introduction to Metamathematics, North-Holland – S C Kleene - 1952
35 Strictness Analysis Aids Time Analysis – Philip Wadler - 1988
7 Time analysis, cost equivalence and program refinement – D Sands - 1991
540 The Implementation of Functional Programming Languages – Peyton Jones, S L - 1987
77 Automatic complexity analysis – M Rosendahl - 1989
49 Fully abstract semantics for observably sequential languages – Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen - 1994
280 Introduction to Automata Theory – J E Hopcroft, R Motwani, J D Ullman - 2006
6 Rum: An intensional theory of function and control abstractions – C Talcott - 1986
4 An Intensional Parallel Processing Language for Applications Programming – E A Ashcroft, A A Faustini, R Jagannathan - 1989
6 The automatic worst case analysis of parallel programs: Simple parallel sorting and algorithms on graphs – W Zimmermann - 1991