Neil Mitchell - PDFSEARCH.IO - Document Search Engine

Neil Mitchell
Results: 50

#	Item
1	Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK Add to Reading List Source URL: community.haskell.org Language: English - Date: 2013-10-12 04:58:09 Computer programming Software engineering Declarative programming Recursion Functional programming Computability theory Theoretical computer science Programming paradigms Algebraic data type Fold Pattern matching Conditional
2	Parser Design Neil Mitchell June 25, 2004 1 Add to Reading List Source URL: community.haskell.org Language: English - Date: 2013-10-12 04:58:09 Programming language implementation Computer programming Computing Parser generators Compiling tools Compiler construction Parsing algorithms Finite automata Yacc Parsing Lex GNU bison
3	Deriving a Relationship from a Single Example Neil Mitchell Abstract Given an appropriate domain specific language (DSL), it is possible Add to Reading List Source URL: community.haskell.org - Date: 2013-10-12 04:58:09
4	Hoogλe Fast Type Searching Neil Mitchell www.cs.york.ac.uk/~ndm/ Add to Reading List Source URL: community.haskell.org - Date: 2013-10-12 04:58:09
5	Want to follow along? http://www.cs.york.ac.uk/~ndm/ads.pdf Ada: Generics Neil Mitchell Add to Reading List Source URL: community.haskell.org Language: English - Date: 2013-10-12 04:58:09 Software engineering Computer programming Computing Procedural programming languages Data types Cross-platform software Concurrent programming languages List Linked list Subroutine Go Generic programming
6	Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of Add to Reading List Source URL: community.haskell.org Language: English - Date: 2013-10-12 04:58:09 Software engineering Computer programming Declarative programming Functional programming Data types Programming language comparisons Type theory Higher-order functions Fold Generic programming Map Type class
7	A Supercompiler for Core Haskell Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy ev Add to Reading List Source URL: community.haskell.org Language: English - Date: 2013-10-12 04:58:09 Software engineering Mathematics Declarative programming Lambda calculus Functional programming Functions and mappings Let expression Embedding Monad Anonymous function
8	Supero: Making Haskell Faster Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy evalu Add to Reading List Source URL: community.haskell.org Language: English - Date: 2013-10-12 04:58:09 Software engineering Computer programming Declarative programming Functional programming Lambda calculus Subroutines Functional languages Literate programming Monad Let expression Glasgow Haskell Compiler Anonymous function

UPDATE