Recursion - PDFSEARCH.IO - Document Search Engine

Recursion
Results: 895

#	Item
111	Analysis with parallel partition 11   We know a pack is O(n) work, O(log n) span ¡  Based Add to Reading List Source URL: twiki.di.uniroma1.it Language: English - Date: 2015-10-28 09:23:18 Sorting algorithms Mathematics Computer programming Software engineering Quicksort Merge sort Best worst and average case Binary search algorithm Recursion Binary logarithm Heapsort Insertion sort
112	Transformation rules from UML4MBT meta-model to SMT meta-model for model animation Jérôme Cantenot Fabrice Ambert Add to Reading List Source URL: st.inf.tu-dresden.de Language: English - Date: 2012-09-25 06:20:13 Software engineering Theoretical computer science Mathematical logic Formal methods Computability theory Lambda calculus Subroutines Satisfiability modulo theories XC HindleyMilner type system First-order logic Recursion
113	Binding-Time Analysis and the Taming of C Pointers ∗ Lars Ole Andersen DIKU, University of Copenhagen Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2010-10-22 08:05:06 Data types Procedural programming languages Type theory C Struct Type safety Pointer C++ classes Recursion ALGOL 68 Type system This
114	Honors Algorithms Lecture: Dynamic Programming Julian Panetta (), based on material from Alan Siegel September 26, 2011 Note: We covered up through 6.3 in class. I fixed the errors we caught, but Add to Reading List Source URL: julianpanetta.com Language: English - Date: 2012-02-14 20:25:30 Theoretical computer science Data types Dynamic programming Mathematical optimization Operations research Optimal control Tree Recursion B-tree Binary tree Algorithm Matrix chain multiplication
115	Currying (what Functions of Several Arguments Really are) More About Higher-Order Functions Remember simple? Björn Lisper Add to Reading List Source URL: www.idt.mdh.se Language: English - Date: 2013-11-27 09:57:47 Higher-order functions Functional programming Subroutines Lambda calculus Programming language comparisons Fold Currying Map Function Recursion Standard ML OCaml
116	The Standard Lisp Report Jed Marti A. C. Hearn M. L. Griss C. Griss Add to Reading List Source URL: reduce-algebra.com Language: English - Date: 2008-12-30 11:47:50 Data types Functional programming Subroutines Lisp Functional languages Eval Anonymous function Fexpr Boolean data type Recursion Map Cons
117	Chlorophyll: Synthesis-Aided Compiler for Low-Power Spatial Architectures Phitchaya Mangpo Phothilimthana Tikhon Jelvis Rohin Shah Add to Reading List Source URL: pl.eecs.berkeley.edu Language: English - Date: 2015-02-13 21:22:08 Data types Combinatorics Object-oriented programming languages Concurrent programming languages Disk partitioning Pointer Partition Scala Recursion Const D Subroutine
118	Type-based Allocation Analysis for Co-Recursion in Lazy Functional Languages 1 2 Add to Reading List Source URL: kashmir.dcc.fc.up.pt Language: English - Date: 2015-07-24 05:23:42 Functional languages Theoretical computer science Functional programming Recursion Type theory Corecursion Lambda calculus Standard ML Lazy evaluation Stream Monad Haskell
119	A Fixed-Point Algorithm for Automated Static Detection of Infinite Loops Andreas Ibing, Alexandra Mai Chair for IT Security TU M¨unchen Boltzmannstrasse 3, 85748 Garching, Germany {ibing,mai}@sec.in.tum.de Add to Reading List Source URL: www.sec.in.tum.de Language: English - Date: 2016-02-01 08:36:29 Recursion Theoretical computer science Formal methods Compiler optimizations Infinite loop Satisfiability modulo theories Control flow For loop Algorithm Termination analysis Loop unrolling Satisfiability
120	Written Examination, May 29th, 2015 Course noThe duration of the examination is 4 hours. Course Name: Functional programming Add to Reading List Source URL: www.imm.dtu.dk Language: English - Date: 2015-05-21 05:34:09 Academic transfer Computability theory Recursion Subroutines Theoretical computer science Grading systems by country

UPDATE