redex trails

Featured Books for "redex trails"

Implementation of Functional Languages: 9th International Workshop, IFL'97, St. Andrews, Scotland, UK, September 10-12, 1997, Selected Papers (Lecture Notes in Computer Science) by Chris Clack See all pages with references to "redex trails". Excerpt - from Front Matter: " ... of an Abstract Data Type; and Sparud and Runciman describe how the tradition- ally resource-hungry technique of recording execution traces ("redex trails") ... " Key Phrases: Peyton Jones, Computer Science, Java Virtual Machine, Chris Clack, Springer-Verlag Berlin Heidelberg, Glasgow Haskell, map dbl, redex trails, relocation chain, global reference counter, laziness transformation, accurate garbage collection (see more) Key Phrases: Peyton Jones, Computer Science, Java Virtual Machine, Chris Clack, Springer-Verlag Berlin Heidelberg, Glasgow Haskell, Glasgow Workshop, Lecture Notes, Principles of Programming Languages, University of Glasgow, Brisk Kernel Language, Concurrent Haskell, Data Par, Brisk Machine, International Conference, Department of Computing Science, International Workshop, Chalmers University, Par Static Eval, University of Nijmegen, Remote Values, Selected Papers, Silvia Breitinger, Glasgow Parallel Haskell, High Performance Functional Computing, map dbl, redex trails, relocation chain, global reference counter, laziness transformation, accurate garbage collection, rnf strategy, inport table, selective trails, dug generator, lambda lifter, index vector sets, uniqueness type system, batched queues, tiny interpreter, interleaved parallelism, indirection field, portable parallel implementation, type constructor classes, heap sliding, sync counter, arity information, parallel runtime system, compiler target language, idealised simulation (see less)

---

Programming Languages: Implementations, Logics, and Programs: 9th International Symposium, PLILP '97, Including a Special Track on Declarative Programming ... (Lecture Notes in Computer Science) by Hugh Glaser See all pages with references to "redex trails". Excerpt - on Page 291: " ... Tracing Lazy Functional Computations Using Redex Trails Jan Sparud and Colin Runciman Department of Computer Science, University of York, Heslington, York, YO1 5DD, UK (e-mail: {sparud,colin}mcs. ... " Key Phrases: Lecture Notes, Programming Lab, Principles of Programming Languages, Rice University, Artificial Intelligence, Composition Tree, weak overriding, parent redex, target calculi, redex trails, recomputation part, following mixin (see more) Key Phrases: Lecture Notes, Programming Lab, Principles of Programming Languages, Rice University, Artificial Intelligence, Composition Tree, A-calculus Ahd, Cambridge University Press, Compilation Rule, Peyton Jones, Automated Deduction, New York, Parallel Processing, Springer Verlag, Chengzheng Sun, Computer Society Press, Disjunction Rule, Research Report, Simon Thompson, University of Copenhagen, Addison-Wesley Publishing Company, Computer Languages, Concurrent Haskell, Handbook of Logic, Napier University, weak overriding, parent redex, target calculi, redex trails, recomputation part, following mixin, static debugger, pedagogic programming environment, preferential version, recursion editor, selective recomputation, equational correspondence, object file size, algebraic rewrite rules, inlining process, comportment analysis, formal translator, standardisation theorem, seed node, compiling translation, disjunctive completion, disjunctive heads, mixin modules, optimizing translation, eager positions (see less)

---

Advanced Functional Programming: 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures (Lecture Notes in Computer Science) by Varmo Vene See all pages with references to "redex trails". Key Phrases: Computer Science, Peyton Jones, Principles of Programming Languages, Implementation of Functional Languages, Ross Paterson, Springer-Verlag Berlin Heidelberg, monadic fold, arr swap, monadic interface, monadic program schemes, typed file system, proc pat (see more) Key Phrases: Computer Science, Peyton Jones, Principles of Programming Languages, Implementation of Functional Languages, Ross Paterson, Springer-Verlag Berlin Heidelberg, Haskell Workshop, Utrecht University, Concurrent Clean, List Nat, Bengt Nordström, Lennart Augustsson, Thierry Coquand, Typing Haskell, Bin Ihs, Glasgow Haskell Compiler, Int Int, Leaf Ihs, Node Leaf, Philip Wadler, Science of Computer Programming, University of Nijmegen, Zhaohui Luo, Add Ihs, Chalmers University of Technology, monadic fold, arr swap, monadic interface, monadic program schemes, typed file system, proc pat, arrow combinators, command combinator, smart constructors, type inferencer, graphical editor components, simulation arrows, monadic extension, quantified type variables, dynamic type system, monadic programs, delay arrow, declarative debugging, arrow class, type safe way, arrow laws, current derivation, previous def, submit function, arrow interface (see less)

---

Implementation of Functional Languages: 12th International Workshop, IFL 2000 Aachen, Germany, September 4-7, 2000. Selected Papers (Lecture Notes in Computer Science) by Markus Mohnen See all pages with references to "redex trails". Key Phrases: Peyton Jones, Concurrent Haskell, Clean Object, Computer Science, International Conference, Haskell Object, reuse conflicts, redex trail, usage polymorphism, local state version, padding dimension, parent redex (see more) Key Phrases: Peyton Jones, Concurrent Haskell, Clean Object, Computer Science, International Conference, Haskell Object, Springer-Verlag Berlin Heidelberg, International Workshop, Principles of Programming Languages, Implementation of Functional Languages, Lecture Notes, Jerzy Karczmarczuk, University of Nijmegen, John Hughes, Petersburg Beach, Related Work There, Springer Verlag, reuse conflicts, redex trail, usage polymorphism, local state version, padding dimension, parent redex, distributed haskell, collective semantics, pending clauses, external post office, individual level program, update marker, speculative tasks, speculative evaluation, array padding, collective communication operations, cache conflicts, bounded polymorphism, constraint abstractions, annotation variables, matching clauses, fairness mechanism, mutable variables, set associativity, typed channel (see less)

---

Search Amazon.com Books for "redex trails"