## Science

### BibTeX

@MISC{Myreen_science,

author = {Magnus O. Myreen},

title = {Science},

year = {}

}

### OpenURL

### Abstract

### Citations

8530 | Introduction to Algorithms - Cormen, Leiserson, et al. - 1990 |

2438 |
The Design and Analysis of Computer Algorithms
- Aho, Hopcroft, et al.
- 1974
(Show Context)
Citation Context ...list. When might you use it? Exercise 15.2 What is the value of ml1 (regarded as a list) after the following declarations and commands are entered at top level? Explain this outcome. val ml1 = mlistOf=-=[1,2,3]-=- and ml2 = mlistOf[4,5,6,7]; join(ml1, ml2); drev ml2; Exercise 15.3 Code destructive reverse using while instead of recursion. (Hint: first, code a function to test whether a mutable list is empty.) ... |

731 |
Structure and Interpretation of Computer Programs
- Abelson, Sussman
- 1996
(Show Context)
Citation Context ...T make programs iterative unless the gain is significant. • People fought to give recursion to programmers: first, in Algol-60. • Your code may turn into a mess! A classic book by Abelson and Sussman =-=[1]-=- used iterative to mean tailrecursive. It describes the Lisp dialect known as Scheme. Iterative functions produce computations resembling those that can be done using while-loops in conventional langu... |

696 |
The art of computer programming., volume 3: Sorting and searching
- Knuth
- 1974
(Show Context)
Citation Context ...runcation to the next larger integer; for example, ⌈3.1⌉ = 4. (Hint: Note that ⌈x⌉ ≤ x + 1 and that lg(x + 1) ≤ lg x + 1 for x ≥ 1.) (Difficult!)IV Foundations of Computer Science 37 Lists Slide 401 =-=[3,5,9]-=-; > [3, 5, 9] : int list it @ [2,10]; > [3, 5, 9, 2, 10] : int list rev [(1,"one"), (2,"two")]; > [(2, "two"), (1, "one")] : (int * string) list A list is an ordered series of elements; repetitions ar... |

508 |
Concrete Mathematics: A Foundation for Computer Science
- Graham, Knuth, et al.
- 1990
(Show Context)
Citation Context ...s space complexity. This lecture considers how to estimate various costs associated with a program. A brief introduction to a difficult subject, it draws upon the excellent texts Concrete Mathematics =-=[6]-=- and Introduction to Algorithms [5].III Foundations of Computer Science 27 Some Illustrative Figures complexity 1 second 1 minute 1 hour gain Slide 302 n 1000 60,000 3,600,000 ×60 n lg n 140 4,893 20... |

412 | Depth-first iterative-deepening: An optimal admissible tree search
- Korf
- 1985
(Show Context)
Citation Context ... is growing exponentially. There are b d+1 nodes at level d + 1; if b ≥ 2, this number actually exceeds the total number of nodes of all previous levels put together, namely (b d+1 − 1)/(b − 1). Korf =-=[11]-=- shows that the time needed for iterative deepening to reach depth d is only b/(b − 1) times that for breadth-first search, if b > 1. This is a constant factor; both algorithms have the same time comp... |

366 |
ML for the Working Programmer
- Paulson
- 1991
(Show Context)
Citation Context ...s a Windows-based interface (due to Arthur Norman), but the compiler itself is the old Edinburgh ML, which is slow and buggy. It supports an out-of-date version of ML: many of the examples in my book =-=[13]-=- will not work. 1 http://www.dina.kvl.dk/~sestoft/mosml.htmlI Foundations of Computer Science 11 The Area of a Circle: A = πr 2 val pi = 3.14159; > val pi = 3.14159 : real Slide 109 pi * 1.5 * 1.5; >... |

332 | The Art of Computer Programming, volume 1: Fundamental Algorithms - Knuth - 1973 |

285 | Why Functional Programming Matters
- Hughes
- 1990
(Show Context)
Citation Context ...mparing some particular type of items, it returns the function sort for sorting lists of that type of items.X Foundations of Computer Science 107 Examples of Generic Sorting Slide 1007 insort (op<=) =-=[5,3,9,8]-=-; > val it = [3, 5, 8, 9] : int list insort (op<=) ["bitten","on","a","bee"]; > val it = ["a", "bee", "bitten", "on"] > : string list insort (op>=) [5,3,9,8]; > val it = [9, 8, 5, 3] : int list Note: ... |

229 |
Random number generators: Good ones are hard to find
- Park, Miller
- 1988
(Show Context)
Citation Context ... of comparisons, C(n), is obtained by solving 2 C(n) ≥ n!; therefore C(n) ≥ log(n!) ≈ n log n − 1.44n. In order to compare the sorting algorithms, we use the following source of pseudo-random numbers =-=[12]-=-: local val a = 16807.0 and m = 2147483647.0 in fun nextrandom seed = let val t = a*seed in t - m * real(floor(t/m)) end and truncto k r = 1 + floor((r / m) * (real k)) end; We bind the identifier rs ... |

77 |
Preliminary Discussion of The Logical Design of An Electronic Computing Instrument
- Burks, Goldstein, et al.
- 1946
(Show Context)
Citation Context ... = (f x) :: map f xs > val map = fn: (’a -> ’b) -> ’a list -> ’b list map (fn s => s ˆ "ppy") ["Hi", "Ho"]; > val it = ["Hippy", "Hoppy"] : string list map (map double) [[1], [2,3]]; > val it = [[2], =-=[4, 6]-=-] : int list list The functional map applies a function to every element of a list, returning a list of the function’s results. “Apply to all” is a fundamental operation and we shall see several appli... |

64 |
Computer Structures: Readings and Examples
- Bell, Newell
- 1971
(Show Context)
Citation Context ...runcation to the next larger integer; for example, ⌈3.1⌉ = 4. (Hint: Note that ⌈x⌉ ≤ x + 1 and that lg(x + 1) ≤ lg x + 1 for x ≥ 1.) (Difficult!)IV Foundations of Computer Science 37 Lists Slide 401 =-=[3,5,9]-=-; > [3, 5, 9] : int list it @ [2,10]; > [3, 5, 9, 2, 10] : int list rev [(1,"one"), (2,"two")]; > [(2, "two"), (1, "one")] : (int * string) list A list is an ordered series of elements; repetitions ar... |

9 | Abstraction in numerical methods
- Sussman, Halfant
- 1988
(Show Context)
Citation Context ... Evaluation Slide 1306 get(2, from 6) ⇒ get(2, Cons(6, fn()=>from(6+1))) ⇒ 6 :: get(1, from(6+1)) ⇒ 6 :: get(1, Cons(7, fn()=>from(7+1))) ⇒ 6 :: 7 :: get(0, Cons(8, fn()=>from(8+1))) ⇒ 6 :: 7 :: [] ⇒ =-=[6,7]-=- Here we ask for two elements of the infinite sequence. In fact, three elements are computed: 6, 7 and 8. Our implementation is slightly too eager. A more complicated datatype declaration could avoid ... |

3 |
Functional Programming using ML
- Wikström
- 1987
(Show Context)
Citation Context ...sing and operating systems functions in addition to the usual numerical ones.I Foundations of Computer Science 14 For more details on ML’s syntax, please consult a textbook. Mine [13] and Wikström’s =-=[16]-=- may be found in many College libraries. Ullman [15], in the Computer Lab library, is also worth a look. Learning guide. Related material is in ML for the Working Programmer, pages 1–47, and especiall... |