Skip to content
Browse files

Work on implementation paper; tutorial fixes

  • Loading branch information...
1 parent 8d4a93b commit 0af8a2ee9f2899693164617bfe2534025a424fb5 Edwin Brady committed Mar 7, 2012
View
9 CHANGELOG
@@ -1,3 +1,12 @@
+New in 0.9.3:
+-------------
+
+User visible changes:
+
+Internal changes:
+
+* Normalise before forcing to catch more forceable arguments
+
New in 0.9.2:
-------------
View
614 impl-paper/hll.tex
@@ -1 +1,615 @@
\section{\Idris{} --- the High Level Language}
+
+\label{sect:hll}
+
+In this section, we give a brief introduction to programming in \Idris{}.
+A more detailed tutorial is available~\cite{idristutorial}.
+
+\subsection{Preliminaries}
+
+\Idris{} defines several primitive types: \tTC{Int}, \tTC{Integer} and
+\tTC{Float} for numeric operations, \tTC{Char} and \tTC{String} for
+text manipulation, and \tTC{Ptr} which represents foreign pointers.
+There are also several data types declared in the library, including
+\tTC{Bool}, with values \tDC{True} and \tDC{False}. All of the usual
+arithmetic and comparison operators are defined for the primitive types,
+and are overloaded using type classes.
+
+An \Idris{} program consists of a module declaration, followed by an optional
+list of imports and a collection of definitions and declarations, a simple example
+of which is shown in Figure \ref{constprims}. Like Haskell, the main function
+is called \texttt{main}, and input and output is managed with an \texttt{IO}
+monad. Unlike Haskell, however, we use a single colon \texttt{:} for type
+declarations, and \remph{all} functions must have a top level type
+declaration, since type inference is in general undecidable for languages with
+dependent types.
+
+A module declaration also opens a \remph{namespace}. The fully qualified names
+declared in this module are \texttt{main.x} and \texttt{main.main}.
+
+\begin{SaveVerbatim}{constprims}
+
+module main
+
+x : Int
+x = 42
+
+main : IO ()
+main = putStrLn ("The answer is " ++ show x)
+
+\end{SaveVerbatim}
+\codefig{constprims}{A simple \Idris{} module}
+
+\subsection{Types and Functions}
+
+Data types are declared in a similar way to Haskell data types, with a similar
+syntax. Natural numbers and lists, for example, are declared as follows in the
+library.
+
+\begin{SaveVerbatim}{natlist}
+
+data Nat = O | S Nat -- Natural numbers
+ -- (zero and successor)
+data List a = Nil | (::) a (List a) -- Polymorphic lists
+
+\end{SaveVerbatim}
+\useverb{natlist}
+
+The above declarations are taken from the standard library. Unary natural
+numbers can be either zero, or
+the successor of another natural number (\texttt{S k}).
+Lists can either be empty (\texttt{Nil})
+or a value added to the front of another list (\texttt{x :: xs}).
+In the declaration for \tTC{List}, we used an infix operator \tDC{::}. New operators
+such as this can be added using a fixity declaration, as follows:
+
+\begin{SaveVerbatim}{infixcons}
+
+infixr 10 ::
+
+\end{SaveVerbatim}
+\useverb{infixcons}
+
+\noindent
+Functions, data constructors and type constuctors may all be given infix
+operators as names. They may be used in prefix form if enclosed in brackets,
+e.g. \tDC{(::)}.
+
+\subsection{Functions}
+
+Functions are implemented by pattern matching, again using a similar syntax to
+Haskell. Some natural number arithmetic functions can be
+defined as follows, again taken from the standard library:
+
+\begin{SaveVerbatim}{natfns}
+
+-- Unary addition
+plus : Nat -> Nat -> Nat
+plus O y = y
+plus (S k) y = S (plus k y)
+
+-- Unary multiplication
+mult : Nat -> Nat -> Nat
+mult O y = O
+mult (S k) y = plus y (mult k y)
+
+\end{SaveVerbatim}
+\useverb{natfns}
+
+\noindent
+The standard arithmetic operators \texttt{+} and \texttt{*} are also overloaded
+for use by \texttt{Nat}, and are implemented
+using the above functions. Unlike Haskell, there is no restriction on whether
+types and function names must begin with a capital letter or not. Function
+names (\tFN{plus} and \tFN{mult} above), data constructors (\tDC{O}, \tDC{S},
+\tDC{Nil} and \tDC{::}) and type constructors (\tTC{Nat} and \tTC{List}) are
+all part of the same namespace.
+
+\Idris{} has an interactive prompt, at which we can test these functions:
+
+\begin{SaveVerbatim}{fntest}
+
+Idris> plus (S (S O)) (S (S O))
+S (S (S (S O))) : Nat
+Idris> mult (S (S (S O))) (plus (S (S O)) (S (S O)))
+S (S (S (S (S (S (S (S (S (S (S (S O))))))))))) : Nat
+
+\end{SaveVerbatim}
+\useverb{fntest}
+
+\noindent
+Like arithmetic operations, integer literals are also overloaded using type classes,
+meaning that we can also test the functions as follows:
+
+\begin{SaveVerbatim}{fntest}
+
+Idris> plus 2 2
+S (S (S (S O))) : Nat
+Idris> mult 3 (plus 2 2)
+S (S (S (S (S (S (S (S (S (S (S (S O))))))))))) : Nat
+
+\end{SaveVerbatim}
+\useverb{fntest}
+
+\subsubsection{\texttt{where} clauses}
+
+Functions can also be defined \emph{locally} using \texttt{where} clauses. For example,
+to define a function which reverses a list, we can use an auxiliary function which
+accumulates the new, reversed list, and which does not need to be visible globally:
+
+\begin{SaveVerbatim}{revwhere}
+
+reverse : List a -> List a
+reverse xs = revAcc [] xs where
+ revAcc : List a -> List a -> List a
+ revAcc acc [] = acc
+ revAcc acc (x :: xs) = revAcc (x :: acc) xs
+
+\end{SaveVerbatim}
+\useverb{revwhere}
+
+\noindent
+Indentation is significant --- functions in the \texttt{where} block must be indented
+further than the outer function.
+
+\textbf{Scope:}
+Any names which are visible in the outer scope are also visible in the \texttt{where}
+clause (unless they have been redefined, such as \texttt{xs} here).
+\emph{However}, names which appear in the type are \emph{not} in scope. In particular,
+in the above example, the \texttt{a} in the top level type and the \texttt{a} in the
+auxiliary definifion \texttt{revAcc} are \emph{not} the same. If this is the required
+behaviour, the \texttt{a} can be brought into scope as follows:
+
+\begin{SaveVerbatim}{revwhereb}
+
+reverse : List a -> List a
+reverse {a} xs = revAcc [] xs where
+ revAcc : List a -> List a -> List a
+ ...
+
+\end{SaveVerbatim}
+\useverb{revwhereb}
+
+\subsubsection{Dependent Types}
+
+A standard example of a dependent type is the type of ``lists with length'',
+conventionally called ``vectors''. In \Idris{}, we declare vectors as follows:
+
+\begin{SaveVerbatim}{vect}
+
+data Vect : Set -> Nat -> Set where
+ Nil : Vect a O
+ (::) : a -> Vect a k -> Vect a (S k)
+
+\end{SaveVerbatim}
+\useverb{vect}
+
+\noindent
+Note that we have used the same constructor names as for \tTC{List}. Ad-hoc
+name overloading such as this is accepted by \Idris{}, provided that the names
+are declared in different namespaces (in practice, normally in different modules).
+Ambiguous constructor names are resolved by type.
+
+This declares a family of types, which requires a different form of declaration
+different from the simple type declarations above. It resembles a Haskell GADT
+declaration: we explicitly state the type
+of the type constructor \tTC{Vect} --- it takes a type and a \tTC{Nat} as an
+argument, where \tTC{Set} stands for the type of types. We say that \tTC{Vect}
+is \emph{parameterised} by a type, and \emph{indexed} over \tTC{Nat}. Each
+constructor targets a different part of the family of types. \tDC{Nil} can only
+be used to construct vectors with zero length, and \tDC{::} to construct
+vectors with non-zero length. In the type of \tDC{::}, we state explicitly that an element
+of type \texttt{a} and a tail of type \texttt{Vect a k} (i.e., a vector of length \texttt{k})
+combine to make a vector of length \texttt{S k}.
+
+We can define functions on dependent types such as \tTC{Vect} in the same way
+as on simple types such as \tTC{List} and \tTC{Nat} above, by pattern matching.
+The type of a function over \tTC{Vect} will describe what happens to the
+lengths of the vectors involved. For example, \tFN{++}, defined in the
+library, appends two \tTC{Vect}s:
+
+\begin{SaveVerbatim}{vapp}
+
+(++) : Vect A n -> Vect A m -> Vect A (n + m)
+(++) Nil ys = ys
+(++) (x :: xs) ys = x :: xs ++ ys
+
+\end{SaveVerbatim}
+\useverb{vapp}
+
+\subsubsection{The Finite Sets}
+
+Finite sets, as the name suggests, are sets with a finite number of elements.
+They are declared as follows in the library:
+
+\begin{SaveVerbatim}{findecl}
+
+data Fin : Nat -> Set where
+ fO : Fin (S k)
+ fS : Fin k -> Fin (S k)
+
+\end{SaveVerbatim}
+\useverb{findecl}
+
+\noindent
+This declares
+\tDC{fO} as the zeroth element of a finite set with \texttt{S k} elements;
+\texttt{fS n} as the
+\texttt{n+1}th element of a finite set with \texttt{S k} elements.
+\tTC{Fin} is indexed by a \tTC{Nat}, which
+represents the number of elements in the set.
+Neither constructor targets \texttt{Fin O}, because we cannot construct an
+element of an empty set.
+
+A useful application of the \tTC{Fin} family is to represent bounded
+natural numbers. Since the first \tTC{n} natural numbers form a finite
+set of \tTC{n} elements, we can treat \tTC{Fin n} as the set of natural
+numbers bounded by \tTC{n}.
+
+For example, the following function which looks up an element in a \tTC{Vect},
+by a bounded index given as a \tTC{Fin n}, is defined in the library:
+
+\begin{SaveVerbatim}{vindex}
+
+index : Fin n -> Vect a n -> a
+index fO (x :: xs) = x
+index (fS k) (x :: xs) = index k xs
+
+\end{SaveVerbatim}
+\useverb{vindex}
+
+\noindent
+This function looks up a value at a given location in a vector. The location is
+bounded by the length of the vector (\texttt{n} in each case), so there is no
+need for a run-time bounds check. The type checker guarantees that the location
+is no larger than the length of the vector.
+
+Note also that there is no case for \texttt{Nil} here. It would be impossible
+to add such a case ---
+since there is no element of \texttt{Fin O}, and the location is a
+\texttt{Fin n}, then \texttt{n} can not be \tDC{O}. As a result, attempting to
+look up an element in an empty vector would give a compile time type error,
+since it would force \texttt{n} to be \tDC{O}.
+
+\subsubsection{Implicit Arguments}
+
+Let us take a closer look at the type of \texttt{index}:
+
+\begin{SaveVerbatim}{vindexty}
+
+index : Fin n -> Vect a n -> a
+
+\end{SaveVerbatim}
+\useverb{vindexty}
+
+\noindent
+It takes two arguments, an element of the finite set of \texttt{n} elements, and a vector
+with \texttt{n} elements of type \texttt{a}. But there are also two names,
+\texttt{n} and \texttt{a}, which are not declared explictly. These are \emph{implicit}
+arguments to \texttt{index}. We could also write the type of \texttt{index} as:
+
+\begin{SaveVerbatim}{vindeximpty}
+
+index : {a:Set} -> {n:Nat} -> Fin n -> Vect a n -> a
+
+\end{SaveVerbatim}
+\useverb{vindeximpty}
+
+\noindent
+Implicit arguments, given in braces \texttt{\{\}} in the type declaration, are not given in
+applications of \texttt{index}; their values can be inferred from the types of
+the \texttt{Fin n} and \texttt{Vect a n} arguments. Any name which appears as a parameter
+or index in a type declaration, but which is otherwise free, will be automatically
+bound as an implicit argument. Indeed, binding arguments in this way is the essence
+of dependent types.
+Implicit arguments can still be given explicitly in applications, using the syntax
+\texttt{\{a=value\}} and \texttt{\{n=value\}}, for example:
+
+\begin{SaveVerbatim}{vindexexp}
+
+index {a=Int} {n=2} fO (2 :: 3 :: Nil)
+
+\end{SaveVerbatim}
+\useverb{vindexexp}
+
+\noindent
+In fact, any argument, implicit or explicit, may be given a name. For example,
+we could have declared the type of \texttt{index} as:
+
+\begin{SaveVerbatim}{vindexn}
+
+index : (i:Fin n) -> (xs:Vect a n) -> a
+
+\end{SaveVerbatim}
+\useverb{vindexn}
+
+\noindent
+This can be useful for improving the readability of type signatures, particularly
+where the name suggests the argument's purpose.
+
+\subsection{Type Classes}
+
+\Idris{} supports overloading in two ways. Firstly, as we have already seen with
+this constructors of \texttt{List} and \texttt{Vect}, names
+can be overloaded in an ad-hoc manner and resolved according to the context in which
+they are used. This is mostly for convenience, to eliminate the need to decorate
+constructor names in similarly structured data types, and eliminate explicit qualification
+of ambiguous names where only one is well-typed.
+
+Secondly, \Idris{} implements \remph{type classes}. This allows a more principled approach
+to overloading --- a type class gives a collection of overloaded operations which describe
+the interface for \remph{instances} of that class.
+
+A simple example
+is the \texttt{Show} type class, which is defined in the library and
+provides an interface for converting values to
+\texttt{String}s:
+
+\begin{SaveVerbatim}{showclass}
+
+class Show a where
+ show : a -> String
+
+\end{SaveVerbatim}
+\useverb{showclass}
+
+\noindent
+This generates a function of the following type (which we call a \emph{method} of the
+\texttt{Show} class):
+
+\begin{SaveVerbatim}{showty}
+
+show : Show a => a -> String
+
+\end{SaveVerbatim}
+\useverb{showty}
+
+An instance of a class
+is defined with an \texttt{instance} declaration, which provides implementations of
+the function for a specific type. For example, the \texttt{Show} instance for \texttt{Nat}
+could be defined as:
+
+\begin{SaveVerbatim}{shownat}
+
+instance Show Nat where
+ show O = "O"
+ show (S k) = "s" ++ show k
+
+Idris> show (S (S (S O)))
+"sssO" : String
+
+\end{SaveVerbatim}
+\useverb{shownat}
+
+\noindent
+Only one instance of a class can be given for a type --- instances may not overlap.
+Instance declarations can themselves have constraints. For example, to define a
+\texttt{Show} instance for vectors, we need to know that there is a \texttt{Show}
+instance for the element type, because we are going to use it to convert each element
+to a \texttt{String}:
+
+\begin{SaveVerbatim}{showvec}
+
+instance Show a => Show (Vect a n) where
+ show xs = "[" ++ show' xs ++ "]" where
+ show' : Vect a n' -> String
+ show' Nil = ""
+ show' (x :: Nil) = show x
+ show' (x :: xs) = show x ++ ", " ++ show' xs
+
+\end{SaveVerbatim}
+\useverb{showvec}
+
+\noindent
+\textbf{Remark: } The type of the auxiliary function \texttt{show'} is
+important. The type variables \texttt{a} and \texttt{n} which are part of the
+instance declaration for \texttt{Show (Vect a n)} are fixed across the entire
+instance declaration. As a result, we do not have to constrain \texttt{a}
+again. Furthermore, it means that if we use \texttt{n} in the type, it refers
+to the (fixed) length of the outermost list \texttt{xs}. Therefore,
+we use a different name for the length \texttt{n'} in \texttt{show'}.
+
+Like Haskell type classes, default definitions can be given in the class declaration.
+Otherwise, all methods must be given in an instance. For example, there is an
+\texttt{Eq} class:
+
+\begin{SaveVerbatim}{eqdefault}
+
+class Eq a where
+ (==) : a -> a -> Bool
+ (/=) : a -> a -> Bool
+
+ x /= y = not (x == y)
+ y == y = not (x /= y)
+
+\end{SaveVerbatim}
+\useverb{eqdefault}
+
+\noindent
+Classes can also be extended. A logical next step from an equality relation \texttt{Eq}
+is to define an ordering relation \texttt{Ord}. We can define an \texttt{Ord} class
+which inherits methods from \texttt{Eq} as well as defining some of its own:
+
+\begin{SaveVerbatim}{ord}
+
+data Ordering = LT | EQ | GT
+
+\end{SaveVerbatim}
+\useverb{ord}
+
+\begin{SaveVerbatim}{eqord}
+
+class Eq a => Ord a where
+ compare : a -> a -> Ordering
+
+ (<) : a -> a -> Bool
+ (>) : a -> a -> Bool
+ (<=) : a -> a -> Bool
+ (>=) : a -> a -> Bool
+ max : a -> a -> a
+ min : a -> a -> a
+
+\end{SaveVerbatim}
+\useverb{eqord}
+
+\subsection{Matching on intermediate values}
+
+\subsubsection{\texttt{let} bindings}
+
+Intermediate values can be calculated using \texttt{let} bindings:
+
+\begin{SaveVerbatim}{letb}
+
+mirror : List a -> List a
+mirror xs = let xs' = rev xs in
+ app xs xs'
+
+\end{SaveVerbatim}
+\useverb{letb}
+
+\noindent
+We can also do simple pattern matching in \texttt{let} bindings. For example, we can extract
+fields from a record as follows, as well as by pattern matching at the top level:
+
+\begin{SaveVerbatim}{letp}
+
+data Person = MkPerson String Int
+
+showPerson : Person -> String
+showPerson p = let MkPerson name age = p in
+ name ++ " is " ++ show age ++ " years old"
+
+\end{SaveVerbatim}
+\useverb{letp}
+\subsubsection{\texttt{case} expressions}
+
+Another way of inspecting intermediate values of \emph{simple} types
+is to use a \texttt{case} expression.
+The following function, for example, splits a string into two at a given character:
+
+\begin{SaveVerbatim}{split}
+
+splitAt : Char -> String -> (String, String)
+splitAt c x = case break (== c) x of
+ (x, y) => (x, strTail y)
+
+\end{SaveVerbatim}
+\useverb{split}
+
+\noindent
+\texttt{break} is a library function which breaks a string into a pair of strings
+at the point where the given function returns true. We then deconstruct the
+pair it returns, and remove the first character of the second string.
+
+A \texttt{case} expression can match several cases, for example, to inspect an
+intermediate value of type \texttt{Maybe a}. Recall \texttt{list\_lookup} which
+looks up an index in a list, returning \texttt{Nothing} if the index is out
+of bounds. We can use this to write \texttt{lookup\_default}, which
+looks up an index and returns a default value if the index is out of bounds:
+
+\begin{SaveVerbatim}{listlookup}
+
+lookup_default : Nat -> List a -> a -> a
+lookup_default i xs def = case list_lookup i xs of
+ Nothing => def
+ Just x => x
+
+\end{SaveVerbatim}
+\useverb{listlookup}
+
+The \texttt{case} construct is intended for simple analysis
+of intermediate expressions to avoid the need to write auxiliary functions, and is
+also used internally to implement pattern matching \texttt{let} and lambda bindings.
+It will \emph{only} work if:
+
+\begin{itemize}
+\item Each branch \emph{matches} a value of the same type, and \emph{returns} a
+value of the same type.
+\item The type of the result is ``known''. i.e. the type of the expression can be
+determined \emph{without} type checking the \texttt{case}-expression itself.
+\end{itemize}
+
+\subsubsection{The \texttt{with} rule}
+
+Since types can depend on values, the form of some arguments can be determined
+by the value of others. For example, if we were to write down the implicit
+length arguments to \texttt{(++)}, we'd see that the form of the length argument was
+determined by whether the vector was empty or not:
+
+\begin{SaveVerbatim}{appdep}
+
+(++) : Vect a n -> Vect a m -> Vect a (n + m)
+(++) {n=O} [] [] = []
+(++) {n=S k} (x :: xs) ys = x :: xs ++ ys
+
+\end{SaveVerbatim}
+\useverb{appdep}
+
+\noindent
+If \texttt{n} was a successor in the \texttt{[]} case, or zero in the
+\texttt{::} case, the definition
+would not be well typed.
+
+Often, we need to match on the result of an intermediate computation
+with a dependent type.
+\Idris{} provides a construct for this, the \texttt{with} rule,
+inspired by views in \Epigram~\cite{McBride2004a},
+which takes account of the
+fact that matching on a value in a dependently typed language can affect what
+we know about the forms of other values.
+
+For example, a \texttt{Nat} is either even or odd.
+If it is even it will
+be the sum of two equal \texttt{Nat}s. Otherwise, it is the sum of two equal \texttt{Nat}s
+plus one:
+
+\begin{SaveVerbatim}{parity}
+
+data Parity : Nat -> Set where
+ even : Parity (n + n)
+ odd : Parity (S (n + n))
+
+\end{SaveVerbatim}
+\useverb{parity}
+
+\noindent
+We say \texttt{Parity} is a \emph{view} of \texttt{Nat}.
+It has a \emph{covering function} which tests whether
+it is even or odd and constructs the predicate accordingly.
+
+\begin{SaveVerbatim}{parityty}
+
+parity : (n:Nat) -> Parity n
+
+\end{SaveVerbatim}
+\useverb{parityty}
+
+\noindent
+Using this, we can write a function which converts a natural number to a list
+of binary digits (least significant first) as follows, using the \texttt{with}
+rule:
+
+\begin{SaveVerbatim}{natToBin}
+
+natToBin : Nat -> List Bool
+natToBin O = Nil
+natToBin k with (parity k)
+ natToBin (j + j) | even = False :: natToBin j
+ natToBin (S (j + j)) | odd = True :: natToBin j
+
+\end{SaveVerbatim}
+\useverb{natToBin}
+
+\noindent
+The value of the result of \texttt{parity k} affects the form of \texttt{k},
+because the result
+of \texttt{parity k} depends on \texttt{k}.
+So, as well as the patterns for the result of the
+intermediate computation (\texttt{even} and \texttt{odd}) right of the
+\texttt{$\mid$}, we also write how
+the results affect the other patterns left of the $\mid$. Note that there is a
+function in the patterns (\texttt{+}) and repeated occurrences of \texttt{j} ---
+this is allowed
+because another argument has determined the form of these patterns.
+
+
View
2 impl-paper/impldtp.tex
@@ -29,6 +29,8 @@
\newcommand{\Ivor}{\textsc{Ivor}}
\newcommand{\Idris}{\textsc{Idris}}
+\newcommand{\TT}{\textsf{TT}}
+\newcommand{\TTdev}{\textsf{TT$_{dev}$}}
\newcommand{\Funl}{\textsc{Funl}}
\newcommand{\Agda}{\textsc{Agda}}
\newcommand{\LamPi}{$\lambda_\Pi$}
View
11 impl-paper/intro.tex
@@ -22,3 +22,14 @@ \subsection{Some Goals}
\end{itemize}
Also note --- to be an expert user of a language requires good understanding of the internals.
+
+\subsection{Typographical conventions}
+
+We'll have \Idris{} programs, \TT{} programs and meta-operations (standing for
+Haskell programs which operate on \Idris{} or \TT{} programs). Suggestion:
+\Idris{} always in \texttt{texttt}, with \texttt{e$_i$} standing for
+non-terminal expressions. \TT{} in mathematical notation and meta-operation
+names either in \textsc{TextSC} or as $\interp{\cdot}$.
+
+Also we will show some interactions at the \texttt{Idris>} prompt, which can be identified
+by the prompt.
View
420 impl-paper/library.bib
@@ -1,135 +1,17 @@
Automatically generated by Mendeley 1.3.1
Any changes to this file will be lost if it is regenerated by Mendeley.
-@inproceedings{Levitation2010,
-author = {Chapman, James and Dagand, Pierre-Evariste and McBride, Conor and Morris, Peter},
-booktitle = {ICFP15th ACM SIGPLAN International Conference on Functional programming (ICFP '10)},
-doi = {10.1145/1932681.1863547},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Chapman et al. - 2010 - The gentle art of levitation.pdf:pdf},
-isbn = {978-1-60558-794-3},
-issn = {03621340},
-keywords = {Dependent Types,data structure,metaprogramming,monads,proof assistants,type systems},
-mendeley-tags = {Dependent Types},
-month = sep,
-number = {9},
-pages = {3},
-title = {{The gentle art of levitation}},
-url = {http://dl.acm.org/citation.cfm?id=1932681.1863547},
-volume = {45},
-year = {2010}
-}
-@article{Brady2006a,
-author = {Brady, E and Hammond, K},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, Hammond - 2006 - A verified staged interpreter is a verified compiler.pdf:pdf},
-journal = {\ldots of the 5th international conference on \ldots},
-keywords = {Dependent Types},
-mendeley-tags = {Dependent Types},
-title = {{A verified staged interpreter is a verified compiler}},
-url = {http://portal.acm.org/citation.cfm?id=1173706.1173724},
-year = {2006}
-}
-@article{Chapman2005epigram,
-author = {Chapman, James and Altenkirch, Thorsten and McBride, Conor},
-file = {:Users/edwin/Documents/Papers/Chapman/2005 Chapman-Epigram reloaded a standalone typechecker.pdf:pdf},
-journal = {Trends in Functional Programming},
-publisher = {Intellect Books},
-title = {{Epigram Reloaded: A Standalone Typechecker for {ETT}}},
-url = {http://books.google.co.uk/books?hl=en&amp;lr=&amp;id=p0yV1sHLubcC&amp;oi=fnd&amp;pg=PA79&amp;dq=epigram+reloaded&amp;ots=x50ou0VMsm&amp;sig=7TjAGohIatNLTWsHcuNcK5hEGGY},
-year = {2005}
-}
-@article{McBride2007,
-author = {McBride, Conor and Paterson, Ross},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, Paterson - 2007 - Applicative programming with effects.pdf:pdf},
-journal = {Journal of functional programming},
-title = {{Applicative programming with effects}},
-url = {http://journals.cambridge.org/abstract_S0956796807006326},
-year = {2007}
-}
-@misc{dagand2011transporting,
-author = {Dagand, Pierre-Evariste and McBride, Conor},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Dagand, McBride - 2011 - Transporting Functions across Ornaments.pdf:pdf},
-title = {{Transporting Functions across Ornaments}},
-url = {http://personal.cis.strath.ac.uk/$\sim$dagand/stuffs/paper-2011-patch/paper.pdf},
-year = {2011}
-}
-@inproceedings{Brady2003,
-author = {Brady, Edwin and McBride, Conor and McKinna, James},
-booktitle = {Types for Proofs and Programs},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, McBride, McKinna - 2003 - Inductive families need not store their indices.pdf:pdf},
-keywords = {Dependent Types},
-mendeley-tags = {Dependent Types},
-title = {{Inductive families need not store their indices}},
-url = {http://www.springerlink.com/index/WBXJJG717N2W3NU2.pdf},
-year = {2003}
-}
-@inproceedings{norell2009dependently,
-author = {Norell, Ulf},
-booktitle = {Advanced Functional Programming},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Norell - 2009 - Dependently typed programming in Agda.pdf:pdf},
-keywords = {Dependent Types},
-mendeley-tags = {Dependent Types},
-pages = {230--266},
-publisher = {Springer},
-title = {{Dependently typed programming in Agda}},
-url = {http://www.springerlink.com/index/8X0H38858233VN26.pdf},
-year = {2009}
-}
-@article{mcbride2010ornamental,
-author = {McBride, Conor},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride - 2010 - Ornamental algebras, algebraic ornaments.pdf:pdf},
-journal = {Journal of Functional Programming},
-title = {{Ornamental algebras, algebraic ornaments}},
-url = {http://personal.cis.strath.ac.uk/$\sim$conor/pub/OAAO/Ornament.pdf},
-year = {2010}
-}
-@misc{Brady2012c,
-author = {Brooks, Fred},
-doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 5.pdf:pdf},
-isbn = {9780321702081},
-issn = {1478-6729},
-number = {1},
-pages = {NP},
-pmid = {22215642},
-title = {{The Design of Design Chapter 5}},
-volume = {34}
-}
-@inproceedings{brady2011epic,
+@misc{idristutorial,
author = {Brady, Edwin},
-booktitle = {Trends in Functional Programming ({TFP}’11)},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2011 - Epic—A Library for Generating Compilers.pdf:pdf},
-title = {{Epic --- A Library for Generating Compilers}},
-url = {http://scholar.google.co.uk/scholar?cites=2588300990390214449&as_sdt=2005&sciodt=0,5&hl=en#1},
-year = {2011}
-}
-@inproceedings{chlipala2010ur,
-author = {Chlipala, Adam},
-booktitle = {ACM SIGPLAN Notices},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Chlipala - 2010 - Ur statically-typed metaprogramming with type-level record computation.pdf:pdf},
-number = {6},
-pages = {122--133},
-publisher = {ACM},
-title = {{Ur: statically-typed metaprogramming with type-level record computation}},
-url = {http://dl.acm.org/citation.cfm?id=1806612},
-volume = {45},
-year = {2010}
-}
-@article{loh2010tutorial,
-author = {L\"{o}h, A. and McBride, C. and Swierstra, W.},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/L\"{o}h, McBride, Swierstra - 2010 - A tutorial implementation of a dependently typed lambda calculus.pdf:pdf},
-journal = {Fundamenta Informaticae},
-number = {2},
-pages = {177--207},
-publisher = {IOS Press},
-title = {{A tutorial implementation of a dependently typed lambda calculus}},
-url = {http://iospress.metapress.com/index/976W4716TM79M6U8.pdf},
-volume = {102},
-year = {2010}
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady/Brady - 2012 - Programming in Idris a tutorial.pdf:pdf},
+title = {{Programming in Idris : a tutorial}},
+url = {http://idris-lang.org/tutorial},
+year = {2012}
}
@inproceedings{Brady2010,
author = {Brady, Edwin and Hammond, Kevin},
booktitle = {Proceedings of the 15th ACM SIGPLAN international conference on Functional programming},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, Hammond - 2010 - Scrapping your inefficient engine using partial evaluation to improve domain-specific language implementation.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady, Hammond/Brady, Hammond - 2010 - Scrapping your inefficient engine using partial evaluation to improve domain-specific language implementation.pdf:pdf},
isbn = {9781605587943},
keywords = {Dependent Types,code generation gives,contrast,dependent types,efficient,harder,however,implementation,likely efficient,ness interpreter,partial evaluation,resulting implementation,un,verify its correctness},
mendeley-tags = {Dependent Types},
@@ -142,7 +24,7 @@ @inproceedings{Brady2010
@misc{The2012c,
author = {Robbins, A and Hannah, E and Lamb, L},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Robbins, Hannah, Lamb - Unknown - Learning the vi and Vim Editors.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Robbins, Hannah, Lamb/Robbins, Hannah, Lamb - Unknown - Learning the vi and Vim Editors.pdf:pdf},
isbn = {9780596529833},
issn = {1478-6729},
pmid = {22215642},
@@ -151,7 +33,7 @@ @misc{The2012c
@article{Haskell2012a,
author = {Biancuzzi, F and Warden, S},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Biancuzzi, Warden - Unknown - Masterminds of Programming Chapter 8.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Biancuzzi, Warden/Biancuzzi, Warden - Unknown - Masterminds of Programming Chapter 8.pdf:pdf},
isbn = {9780596801670},
issn = {1478-6729},
pmid = {22215642},
@@ -160,7 +42,7 @@ @article{Haskell2012a
@inproceedings{Brady2006b,
author = {Brady, Edwin},
booktitle = {Implementation and Application of Functional Languages ({IFL}'06)},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2006 - Ivor, a proof engine.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady/Brady - 2006 - Ivor, a proof engine.pdf:pdf},
isbn = {978-3-540-74129-9},
month = sep,
pages = {145----162},
@@ -173,7 +55,7 @@ @article{Hoare1978
author = {Hoare, C A R},
doi = {10.1016/0167-6423(87)90028-1},
editor = {McKeag, R M and Macnaghten, A M},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Hoare - 1978 - Communicating sequential processes.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Hoare/Hoare - 1978 - Communicating sequential processes.pdf:pdf},
isbn = {0131532715},
issn = {01676423},
journal = {Communications of the ACM},
@@ -192,7 +74,7 @@ @inproceedings{Sheard2005
author = {Sheard, Tim},
booktitle = {Proceedings of the 2005 ACM SIGPLAN workshop on Haskell - Haskell '05},
doi = {10.1145/1088348.1088356},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Sheard - 2005 - Putting curry-howard to work.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Sheard/Sheard - 2005 - Putting curry-howard to work.pdf:pdf},
isbn = {159593071X},
keywords = {GADT,curry-howard isomorphism,extensional kind system,haskell,logic},
month = sep,
@@ -206,7 +88,7 @@ @inproceedings{Pasalic2002
author = {Pa\v{s}alic, Emir and Taha, Walid and Sheard, Tim},
booktitle = {International Conference on Functional Programming},
doi = {10.1145/583852.581499},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Pa\v{s}alic, Taha, Sheard - 2002 - Tagless staged interpreters for typed languages.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Pa\v{s}alic, Taha, Sheard/Pa\v{s}alic, Taha, Sheard - 2002 - Tagless staged interpreters for typed languages.pdf:pdf},
isbn = {1-58113-487-8},
issn = {03621340},
keywords = {calculus of constructions,definitional interpreters,domain-specific languages,multi-stage programming},
@@ -220,7 +102,7 @@ @inproceedings{Pasalic2002
}
@inproceedings{gibbons2011modularising,
author = {Gibbons, J. and Ko, H.S. and Others},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Ko, Gibbons/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
title = {{Modularising inductive families}},
url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html},
year = {2011}
@@ -230,7 +112,7 @@ @inproceedings{NanevskiAAMorrisett2008
author = {{Nanevski A A Morrisett}, G B Shinnar A B Govereau P B Birkedal L C},
booktitle = {International Conference on Functional Programming},
doi = {10.1145/1411204.1411237},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Nanevski A A Morrisett - 2008 - Ynot Dependent types for imperative programs.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Nanevski A A Morrisett/Nanevski A A Morrisett - 2008 - Ynot Dependent types for imperative programs.pdf:pdf},
isbn = {9781595939197},
issn = {15232867},
keywords = {Dependent Types},
@@ -256,7 +138,7 @@ @article{mccann2000packet
@inproceedings{lempsink2009type,
author = {Lempsink, E. and Leather, S. and L\"{o}h, A.},
booktitle = {Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Lempsink, Leather, L\"{o}h - 2009 - Type-safe diff for families of datatypes.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Lempsink, Leather, L\"{o}h/Lempsink, Leather, L\"{o}h - 2009 - Type-safe diff for families of datatypes.pdf:pdf},
pages = {61--72},
publisher = {ACM},
title = {{Type-safe diff for families of datatypes}},
@@ -309,7 +191,7 @@ @misc{Bove2008
author = {Bove, Ana and Dybjer, Peter},
booktitle = {Notes},
doi = {10.1007/978-3-642-03153-3_2},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Bove, Dybjer - 2008 - Dependent Types at Work.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Bove, Dybjer/Bove, Dybjer - 2008 - Dependent Types at Work.pdf:pdf},
number = {February},
pages = {57--99},
publisher = {Springer},
@@ -321,15 +203,15 @@ @misc{Bove2008
@inproceedings{madhavapeddy2010turning,
author = {Madhavapeddy, A. and Mortier, R. and Sohan, R. and Gazagnaire, T. and Hand, S. and Deegan, T. and McAuley, D. and Crowcroft, J.},
booktitle = {Proceedings of the 2nd USENIX conference on Hot topics in cloud computing},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Madhavapeddy et al. - 2010 - Turning down the LAMP software specialisation for the cloud.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Madhavapeddy et al/Madhavapeddy et al. - 2010 - Turning down the LAMP software specialisation for the cloud.pdf:pdf},
publisher = {USENIX Association},
title = {{Turning down the LAMP: software specialisation for the cloud}},
url = {http://dl.acm.org/citation.cfm?id=1863114},
year = {2010}
}
@article{gordon2003authenticity,
author = {Gordon, A.D. and Jeffrey, A.},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Gordon, Jeffrey - 2003 - Authenticity by typing for security protocols.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Gordon, Jeffrey/Gordon, Jeffrey - 2003 - Authenticity by typing for security protocols.pdf:pdf},
journal = {Journal of computer security},
number = {4},
pages = {451--520},
@@ -351,7 +233,7 @@ @inproceedings{ko2011modularising
@inproceedings{l,
author = {L\"{a}mmel, R. and Jones, S.P.},
booktitle = {ACM SIGPLAN Notices},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/L\"{a}mmel, Jones - 2003 - Scrap your boilerplate a practical design pattern for generic programming.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/L\"{a}mmel, Jones/L\"{a}mmel, Jones - 2003 - Scrap your boilerplate a practical design pattern for generic programming.pdf:pdf},
number = {3},
pages = {26--37},
publisher = {ACM},
@@ -360,6 +242,33 @@ @inproceedings{l
volume = {38},
year = {2003}
}
+@inproceedings{Levitation2010,
+author = {Chapman, James and Dagand, Pierre-Evariste and McBride, Conor and Morris, Peter},
+booktitle = {ICFP15th ACM SIGPLAN International Conference on Functional programming (ICFP '10)},
+doi = {10.1145/1932681.1863547},
+file = {:Users/edwin/Documents/Mendeley Desktop/Chapman et al/Chapman et al. - 2010 - The gentle art of levitation.pdf:pdf},
+isbn = {978-1-60558-794-3},
+issn = {03621340},
+keywords = {Dependent Types,data structure,metaprogramming,monads,proof assistants,type systems},
+mendeley-tags = {Dependent Types},
+month = sep,
+number = {9},
+pages = {3},
+title = {{The gentle art of levitation}},
+url = {http://dl.acm.org/citation.cfm?id=1932681.1863547},
+volume = {45},
+year = {2010}
+}
+@article{Brady2006a,
+author = {Brady, E and Hammond, K},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady, Hammond/Brady, Hammond - 2006 - A verified staged interpreter is a verified compiler.pdf:pdf},
+journal = {\ldots of the 5th international conference on \ldots},
+keywords = {Dependent Types},
+mendeley-tags = {Dependent Types},
+title = {{A verified staged interpreter is a verified compiler}},
+url = {http://portal.acm.org/citation.cfm?id=1173706.1173724},
+year = {2006}
+}
@inproceedings{bhargavan2010modular,
author = {Bhargavan, K. and Fournet, C. and Gordon, A.D.},
booktitle = {ACM Sigplan Notices},
@@ -374,7 +283,7 @@ @inproceedings{bhargavan2010modular
@inproceedings{stump2010resource,
author = {Stump, A. and Austin, E.},
booktitle = {Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Stump, Austin - 2010 - Resource typing in Guru.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Stump, Austin/Stump, Austin - 2010 - Resource typing in Guru.pdf:pdf},
pages = {27--38},
publisher = {ACM},
title = {{Resource typing in Guru}},
@@ -383,7 +292,7 @@ @inproceedings{stump2010resource
}
@phdthesis{norell2007thesis,
author = {Norell, Ulf},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Norell - 2007 - Towards a practical programming language based on dependent type theory.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Norell/Norell - 2007 - Towards a practical programming language based on dependent type theory.pdf:pdf},
keywords = {Dependent Types},
mendeley-tags = {Dependent Types},
publisher = {Citeseer},
@@ -392,6 +301,25 @@ @phdthesis{norell2007thesis
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.65.7934&amp;rep=rep1&amp;type=pdf},
year = {2007}
}
+@article{Swierstra2011,
+author = {Swierstra, W},
+file = {:Users/edwin/Documents/Mendeley Desktop/Swierstra/Swierstra - 2011 - Sorted Verifying the Problem of the {Dutch National} Flag in {Agda}.pdf:pdf},
+journal = {Journal of Functional Programming},
+number = {6},
+pages = {575----583},
+title = {{Sorted: Verifying the Problem of the {Dutch National} Flag in {Agda}}},
+url = {http://journals.cambridge.org/abstract_S0956796811000207},
+volume = {21},
+year = {2011}
+}
+@inproceedings{Sculthorpe2009,
+author = {Sculthorpe, Neil and Nilsson, Henrik},
+booktitle = {International Conference on Functional Programming ({ICFP} '09)},
+file = {:Users/edwin/Documents/Mendeley Desktop/Sculthorpe, Nilsson/Sculthorpe, Nilsson - 2009 - Safe functional reactive programming through dependent types.pdf:pdf},
+title = {{Safe functional reactive programming through dependent types}},
+url = {http://dl.acm.org/citation.cfm?id=1596558},
+year = {2009}
+}
@article{Epstein2011,
author = {Epstein, Jeff and Black, Andrew P and Peyton-jones, Simon},
institution = {Microsoft Research},
@@ -420,13 +348,22 @@ @inproceedings{taha1997multi
volume = {32},
year = {1997}
}
+@article{Chapman2005epigram,
+author = {Chapman, James and Altenkirch, Thorsten and McBride, Conor},
+file = {:Users/edwin/Documents/Mendeley Desktop/Chapman, Altenkirch, McBride/Chapman, Altenkirch, McBride - 2005 - Epigram Reloaded A Standalone Typechecker for {ETT}.pdf:pdf},
+journal = {Trends in Functional Programming},
+publisher = {Intellect Books},
+title = {{Epigram Reloaded: A Standalone Typechecker for {ETT}}},
+url = {http://books.google.co.uk/books?hl=en&amp;lr=&amp;id=p0yV1sHLubcC&amp;oi=fnd&amp;pg=PA79&amp;dq=epigram+reloaded&amp;ots=x50ou0VMsm&amp;sig=7TjAGohIatNLTWsHcuNcK5hEGGY},
+year = {2005}
+}
@article{Hughes1989,
abstract = {As software becomes more and more complex, it is more and more important to structure it well. Well-structured software is easy to write, easy to debug, and provides a collection of modules that can be re-used to reduce future programming costs. Conventional languages place conceptual limits on the way problems can be modularised. Functional languages push those limits back. In this paper we show that two features of functional languages in particular, higher-order functions and lazy evaluation, can contribute greatly to modularity. As examples, we manipulate lists and trees, program several numerical algorithms, and implement the alpha-beta heuristic (an algorithm from Artificial Intelligence used in game-playing programs). Since modularity is the key to successful programming, functional languages are vitally important to the real world.},
author = {Hughes, J},
chapter = {2},
doi = {10.1093/comjnl/32.2.98},
editor = {Turner, David A},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Hughes - 1989 - Why Functional Programming Matters.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Hughes/Hughes - 1989 - Why Functional Programming Matters.pdf:pdf},
institution = {Programming Methodology Group, University of {G\"{o}teborg} and Chalmers Institute of Technology, Sweden},
isbn = {0201172364},
issn = {00104620},
@@ -441,7 +378,7 @@ @article{Hughes1989
}
@article{marlow2006making,
author = {Marlow, S. and {Peyton Jones}, S.},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Marlow, Peyton Jones - 2006 - Making a fast curry pushenter vs. evalapply for higher-order languages.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Marlow, Peyton Jones/Marlow, Peyton Jones - 2006 - Making a fast curry pushenter vs. evalapply for higher-order languages.pdf:pdf},
journal = {Journal of Functional Programming},
number = {4-5},
pages = {415--449},
@@ -469,7 +406,7 @@ @article{Mandelbaum2007
}
@phdthesis{McBride1999,
author = {McBride, Conor},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride - 1999 - Dependently typed functional programs and their proofs.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/McBride/McBride - 1999 - Dependently typed functional programs and their proofs.pdf:pdf},
keywords = {Dependent Types},
mendeley-tags = {Dependent Types},
school = {University of Edinburgh},
@@ -480,7 +417,7 @@ @phdthesis{McBride1999
@inproceedings{oury2008power,
author = {Oury, N. and Swierstra, W.},
booktitle = {International Conference on Functional Programming},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Oury, Swierstra - 2008 - The power of Pi.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Oury, Swierstra/Oury, Swierstra - 2008 - The power of Pi.pdf:pdf},
keywords = {Dependent Types},
mendeley-tags = {Dependent Types},
number = {9},
@@ -500,17 +437,25 @@ @inproceedings{atkey2009unembedding
url = {http://dl.acm.org/citation.cfm?id=1596644},
year = {2009}
}
+@article{McBride2007,
+author = {McBride, Conor and Paterson, Ross},
+file = {:Users/edwin/Documents/Mendeley Desktop/McBride, Paterson/McBride, Paterson - 2007 - Applicative programming with effects.pdf:pdf},
+journal = {Journal of functional programming},
+title = {{Applicative programming with effects}},
+url = {http://journals.cambridge.org/abstract_S0956796807006326},
+year = {2007}
+}
@misc{Abel1998,
author = {Abel, Andreas},
booktitle = {Language},
-file = {:Users/edwin/Downloads/10.1.1.44.3494.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Abel/Abel - 1998 - foetus - Termination Checker for Simple Functional Programs.pdf:pdf},
title = {{foetus - Termination Checker for Simple Functional Programs}},
year = {1998}
}
@inproceedings{Brady2005a,
author = {Brady, E and Hammond, K},
booktitle = {Implementation and Application of Functional \ldots},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, Hammond - 2005 - A dependently typed framework for static analysis of program execution costs.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady, Hammond/Brady, Hammond - 2005 - A dependently typed framework for static analysis of program execution costs.pdf:pdf},
keywords = {Dependent Types},
mendeley-tags = {Dependent Types},
title = {{A dependently typed framework for static analysis of program execution costs}},
@@ -520,23 +465,39 @@ @inproceedings{Brady2005a
@misc{altenkirch2005dependent,
author = {Altenkirch, T. and McBride, C. and McKinna, J.},
booktitle = {Manuscript, available online},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch, McBride, McKinna - 2005 - Why dependent types matter.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Altenkirch, McBride, McKinna/Altenkirch, McBride, McKinna - 2005 - Why dependent types matter.pdf:pdf},
title = {{Why dependent types matter}},
url = {http://www.cs.nott.ac.uk/$\sim$txa/talks/splst11.pdf},
year = {2005}
}
+@misc{dagand2011transporting,
+author = {Dagand, Pierre-Evariste and McBride, Conor},
+file = {:Users/edwin/Documents/Mendeley Desktop/Dagand, McBride/Dagand, McBride - 2011 - Transporting Functions across Ornaments.pdf:pdf},
+title = {{Transporting Functions across Ornaments}},
+url = {http://personal.cis.strath.ac.uk/$\sim$dagand/stuffs/paper-2011-patch/paper.pdf},
+year = {2011}
+}
+@inproceedings{bradyresource,
+author = {Brady, Edwin and Hammond, Kevin},
+booktitle = {Practical Applications of Declarative Languages ({PADL} 2012)},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady, Hammond/Brady, Hammond - 2012 - Resource-safe Systems Programming with Embedded Domain Specific Languages.pdf:pdf},
+pages = {242----257},
+title = {{Resource-safe Systems Programming with Embedded Domain Specific Languages}},
+url = {http://www.cs.st-andrews.ac.uk/$\sim$eb/drafts/dsl-idris.pdf},
+year = {2012}
+}
@misc{Resolution2012a,
author = {Fall, Kevin R and Stevens, W. Richard},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Fall, Stevens - Unknown - TCPIP Illustrated Volume 1 Chapter 11.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Fall, Stevens/Fall, Stevens - Unknown - TCPIP Illustrated Volume 1 Chapter 11.pdf:pdf},
issn = {1478-6729},
pmid = {22215642},
title = {{TCP/IP Illustrated Volume 1 Chapter 11}}
}
@inproceedings{madhavapeddy2007melange,
author = {Madhavapeddy, A. and Ho, A. and Deegan, T. and Scott, D. and Sohan, R.},
booktitle = {ACM SIGOPS Operating Systems Review},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Madhavapeddy et al. - 2007 - Melange creating a functional internet.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Madhavapeddy et al/Madhavapeddy et al. - 2007 - Melange creating a functional internet.pdf:pdf},
number = {3},
pages = {101--114},
publisher = {ACM},
@@ -548,15 +509,24 @@ @inproceedings{madhavapeddy2007melange
@misc{The2012b,
author = {Brooks, Fred},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 1.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brooks/Brooks - Unknown - The Design of Design Chapter 1.pdf:pdf},
isbn = {9780321702081},
issn = {1478-6729},
pmid = {22215642},
title = {{The Design of Design Chapter 1}}
}
+@misc{Abadi1997,
+author = {Abadi, Martin and Gordon, Andrew D},
+booktitle = {4TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY},
+file = {:Users/edwin/Documents/Mendeley Desktop/Abadi, Gordon/Abadi, Gordon - 1997 - A calculus for cryptographic protocols The spi calculus.pdf:pdf},
+pages = {36 -- 47},
+title = {{A calculus for cryptographic protocols: The spi calculus}},
+url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2176},
+year = {1997}
+}
@phdthesis{Brady2005,
author = {Brady, Edwin},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2005 - Practical Implementation of a Dependently Typed Functional Programming \ldots.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady/Brady - 2005 - Practical Implementation of a Dependently Typed Functional Programming Language.pdf:pdf},
keywords = {Dependent Types},
mendeley-tags = {Dependent Types},
school = {University of Durham},
@@ -567,7 +537,7 @@ @phdthesis{Brady2005
@inproceedings{swierstra2007beauty,
author = {Swierstra, W. and Altenkirch, T.},
booktitle = {Proceedings of the ACM SIGPLAN workshop on Haskell workshop},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Swierstra, Altenkirch - 2007 - Beauty in the beast.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Swierstra, Altenkirch/Swierstra, Altenkirch - 2007 - Beauty in the beast.pdf:pdf},
pages = {25--36},
publisher = {ACM},
title = {{Beauty in the beast}},
@@ -578,7 +548,7 @@ @article{McBride2004a
abstract = {ABSTRACT Pattern matching has proved an extremely powerful and durable notion in functional programming. This paper contributes a new programming notation for type theory which elaborates the notion in various ways. First, as is by now quite well-known in the type theory community, definition by pattern matching becomes a more discriminating tool in the presence of dependent types, since it refines the explanation of types as well as values. This becomes all the more true in the presence of the rich class of datatypes known as inductive families (Dybjer, 1991). Secondly, as proposed by Peyton Jones (1997) for Haskell, and independently rediscovered by us, subsidiary case analyses on the results of intermediate computations, which commonly take place on the right-hand side of definitions by pattern matching, should rather be handled on the left. In simply-typed languages, this subsumes the trivial case of Boolean guards; in our setting it becomes yet more powerful. Thirdly, elementary pattern matching decompositions have a well-defined interface given by a dependent type; they correspond to the statement of an induction principle for the datatype. More general, user-definable decompositions may be defined which also have types of the same general form. Elementary pattern matching may therefore be recast in abstract form, with a semantics given by translation. Such abstract decompositions of data generalize Wadler&apos;s (1987) notion of &lsquo;view&rsquo;. The programmer wishing to introduce a new view of a type mathitT, and exploit it directly in pattern matching, may do so via a standard programming idiom. The type theorist, looking through the Curry&ndash;Howard lens, may see this as proving a theorem, one which establishes the validity of a new induction principle for mathitT. We develop enough syntax and semantics to account for this high-level style of programming in dependent type theory. We close with the development of a typechecker for the simply-typed lambda calculus, which furnishes a view of raw terms as either being well-typed, or containing an error. The implementation of this view is ipso facto a proof that typechecking is decidable.},
author = {McBride, Conor and McKinna, James},
doi = {10.1017/S0956796803004829},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, McKinna - 2004 - The view from the left.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/McBride, McKinna/McBride, McKinna - 2004 - The view from the left.pdf:pdf},
issn = {09567968},
journal = {Journal of Functional Programming},
keywords = {Dependent Types},
@@ -596,7 +566,7 @@ @inproceedings{Augustsson1998
author = {Augustsson, Lennart},
booktitle = {International Conference on Functional Programming},
doi = {10.1097/MEG.0b013e328342f213},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Augustsson - 1998 - Cayenne - a language with dependent types.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Augustsson/Augustsson - 1998 - Cayenne - a language with dependent types.pdf:pdf},
issn = {14735687},
keywords = {Depe,Dependent Types},
mendeley-tags = {Depe,Dependent Types},
@@ -611,7 +581,7 @@ @inproceedings{Augustsson1998
}
@article{fisher2006next,
author = {Fisher, K. and Mandelbaum, Y. and Walker, D.},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Fisher, Mandelbaum, Walker - 2010 - The next 700 data description languages.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Fisher, Mandelbaum, Walker/Fisher, Mandelbaum, Walker - 2010 - The next 700 data description languages.pdf:pdf},
journal = {Journal of the ACM},
number = {2},
pages = {1--51},
@@ -626,7 +596,7 @@ @inproceedings{Wadler1989
author = {Wadler, Philip},
booktitle = {Proceedings of the fourth international conference on Functional programming languages and computer architecture},
doi = {10.1145/99370.99404},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Wadler - 1989 - Theorems for free!.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Wadler/Wadler - 1989 - Theorems for free!.pdf:pdf},
isbn = {0897913280},
number = {June},
pages = {347--359},
@@ -639,7 +609,7 @@ @inproceedings{Wadler1989
@misc{Protocols2012a,
author = {Anderson, Ross},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Anderson - Unknown - Security Engineering Chapter 3.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Anderson/Anderson - Unknown - Security Engineering Chapter 3.pdf:pdf},
isbn = {9780470068526},
issn = {1478-6729},
pmid = {22215642},
@@ -648,7 +618,7 @@ @misc{Protocols2012a
@inproceedings{barras2008implicit,
author = {Barras, B. and Bernardo, B.},
booktitle = {Foundations of Software Science and Computational Structures},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Barras, Bernardo - 2008 - The implicit calculus of constructions as a programming language with dependent types.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Barras, Bernardo/Barras, Bernardo - 2008 - The implicit calculus of constructions as a programming language with dependent types.pdf:pdf},
pages = {365--379},
publisher = {Springer},
title = {{The implicit calculus of constructions as a programming language with dependent types}},
@@ -657,7 +627,7 @@ @inproceedings{barras2008implicit
}
@article{landin1966next,
author = {Landin, P.J.},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Landin - 1966 - The next 700 programming languages.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Landin/Landin - 1966 - The next 700 programming languages.pdf:pdf},
journal = {Communications of the ACM},
number = {3},
pages = {157--166},
@@ -670,16 +640,26 @@ @article{landin1966next
@misc{Brady2012b,
author = {Brooks, Fred},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 2.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brooks/Brooks - Unknown - The Design of Design Chapter 2.pdf:pdf},
isbn = {9780321702081},
issn = {1478-6729},
pmid = {22215642},
title = {{The Design of Design Chapter 2}}
}
+@inproceedings{Brady2003,
+author = {Brady, Edwin and McBride, Conor and McKinna, James},
+booktitle = {Types for Proofs and Programs},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady, McBride, McKinna/Brady, McBride, McKinna - 2003 - Inductive families need not store their indices.pdf:pdf},
+keywords = {Dependent Types},
+mendeley-tags = {Dependent Types},
+title = {{Inductive families need not store their indices}},
+url = {http://www.springerlink.com/index/WBXJJG717N2W3NU2.pdf},
+year = {2003}
+}
@misc{Nodes2012a,
author = {Brooks, Fred},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 3.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brooks/Brooks - Unknown - The Design of Design Chapter 3.pdf:pdf},
isbn = {9780321702081},
issn = {1478-6729},
pmid = {22215642},
@@ -688,7 +668,7 @@ @misc{Nodes2012a
@article{Abel2010,
abstract = {Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make termination checking robust and suitable for strong abstractions like higher-order functions and polymorphism. To study the application of sized types to proof assistants and programming languages based on dependent type theory, we have implemented a core language, MiniAgda, with explicit handling of sizes. New considerations were necessary to soundly integrate sized types with dependencies and pattern matching, which was made possible by concepts such as inaccessible patterns and parametric function spaces. This paper provides an introduction to MiniAgda by example and informal explanations of the underlying principles.},
author = {Abel, Andreas},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Abel - 2010 - MiniAgda Integrating Sized and Dependent Types.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Abel/Abel - 2010 - MiniAgda Integrating Sized and Dependent Types.pdf:pdf},
journal = {EPTCS},
pages = {1--15},
title = {{MiniAgda: Integrating Sized and Dependent Types}},
@@ -698,21 +678,33 @@ @article{Abel2010
}
@book{Bird2010,
author = {Bird, Richard},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Bird - 2010 - Pearls of Functional Algorithm Design.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Bird/Bird - 2010 - Pearls of Functional Algorithm Design.pdf:pdf},
isbn = {9780521513388},
title = {{Pearls of Functional Algorithm Design}},
year = {2010}
}
@inproceedings{czarnecki2004dsl,
author = {Czarnecki, K. and O’Donnell, J. and Striegnitz, J. and Taha, W.},
booktitle = {Domain-Specific Program Generation},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Czarnecki et al. - 2004 - DSL implementation in MetaOCaml, Template Haskell, and C.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Czarnecki et al/Czarnecki et al. - 2004 - DSL implementation in MetaOCaml, Template Haskell, and C.pdf:pdf},
pages = {51--72},
publisher = {Springer},
title = {{DSL implementation in MetaOCaml, Template Haskell, and C++}},
url = {http://www.springerlink.com/index/NL620EL7N94M161H.pdf},
year = {2004}
}
+@inproceedings{norell2009dependently,
+author = {Norell, Ulf},
+booktitle = {Advanced Functional Programming},
+file = {:Users/edwin/Documents/Mendeley Desktop/Norell/Norell - 2009 - Dependently typed programming in Agda.pdf:pdf},
+keywords = {Dependent Types},
+mendeley-tags = {Dependent Types},
+pages = {230--266},
+publisher = {Springer},
+title = {{Dependently typed programming in Agda}},
+url = {http://www.springerlink.com/index/8X0H38858233VN26.pdf},
+year = {2009}
+}
@article{danielsson2011parsing,
author = {Danielsson, N. and Norell, U.},
journal = {Implementation and Application of Functional Languages},
@@ -738,7 +730,7 @@ @article{Jones2003
@article{Altenkirch2010a,
abstract = {We begin by revisiting the idea of using a universe of types to write generic programs in a dependently typed setting by constructing a universe for Strictly Positive Types (SPTs). Here we extend this construction to cover dependent types, i.e. Strictly Positive Families (SPFs), thereby fixing a gap left open in previous work. Using the approach presented here we are able to represent all of Epigrams datatypes within Epigram including the universe of datatypes itself.},
author = {Altenkirch, Thorsten and Mcbride, Conor and Morris, Peter},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch, Mcbride, Morris - 2010 - Generic Programming with Dependent Types.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Altenkirch, Mcbride, Morris/Altenkirch, Mcbride, Morris - 2010 - Generic Programming with Dependent Types.pdf:pdf},
journal = {Citeseer},
publisher = {Citeseer},
title = {{Generic Programming with Dependent Types}},
@@ -747,14 +739,14 @@ @article{Altenkirch2010a
}
@phdthesis{Okasaki1996,
author = {Okasaki, Chris},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Okasaki - 1996 - Purely Functional Data Structures.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Okasaki/Okasaki - 1996 - Purely Functional Data Structures.pdf:pdf},
school = {Carnegie Mellon University},
title = {{Purely Functional Data Structures}},
year = {1996}
}
@misc{altenkirch2008nσ,
author = {Altenkirch, T. and Oury, N.},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch, Oury - 2008 - $Pi$$Sigma$ A Core Language for Dependently Typed Programming.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Altenkirch, Oury/Altenkirch, Oury - 2008 - $Pi$$Sigma$ A Core Language for Dependently Typed Programming.pdf:pdf},
title = {{$\Pi$$\Sigma$: A Core Language for Dependently Typed Programming}},
url = {http://verse.aasemoon.com/images/6/6f/PiSigma.pdf},
year = {2008}
@@ -764,7 +756,7 @@ @inproceedings{Brady2011a
author = {Brady, Edwin},
booktitle = {Proceedings of the 5th {ACM} workshop on Programming languages meets program verification - {PLPV} '11},
doi = {10.1145/1929529.1929536},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2011 - Idris --- Systems Programming Meets Full Dependent Types.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady/Brady - 2011 - Idris --- Systems Programming Meets Full Dependent Types.pdf:pdf},
isbn = {9781450304870},
keywords = {Dependent Types,data description,dependent types},
mendeley-tags = {Dependent Types},
@@ -776,16 +768,24 @@ @inproceedings{Brady2011a
}
@article{Steiner1988,
author = {Steiner, JG},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Steiner - 1988 - Kerberos An authentication service for open network systems.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Steiner/Steiner - 1988 - Kerberos An authentication service for open network systems.pdf:pdf},
journal = {Proc. Winter USENIX Conference},
title = {{Kerberos: An authentication service for open network systems}},
url = {http://www.cse.nd.edu/$\sim$dthain/courses/cse598z/fall2004/papers/kerberos.pdf},
year = {1988}
}
+@inproceedings{Fournet2011,
+author = {Fournet, Cedric and Bhargavan, Karthikeyan and Gordon, Andrew D},
+booktitle = {Foundations of security analysis and design {VI}},
+file = {:Users/edwin/Documents/Mendeley Desktop/Fournet, Bhargavan, Gordon/Fournet, Bhargavan, Gordon - 2010 - Cryptographic verification by typing for a sample protocol implementation.pdf:pdf},
+title = {{Cryptographic verification by typing for a sample protocol implementation}},
+url = {http://www.springerlink.com/index/V168041M46658R73.pdf},
+year = {2010}
+}
@inproceedings{augustsson2008paradise,
author = {Augustsson, L. and Mansell, H. and Sittampalam, G.},
booktitle = {International Conference on Functional Programming},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Augustsson, Mansell, Sittampalam - 2008 - Paradise a two-stage DSL embedded in Haskell.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Augustsson, Mansell, Sittampalam/Augustsson, Mansell, Sittampalam - 2008 - Paradise a two-stage DSL embedded in Haskell.pdf:pdf},
number = {9},
pages = {225--228},
publisher = {ACM},
@@ -796,13 +796,13 @@ @inproceedings{augustsson2008paradise
}
@misc{Bloat,
author = {Brooks, Fred},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 4.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brooks/Brooks - Unknown - The Design of Design Chapter 4.pdf:pdf},
isbn = {9780321702081},
title = {{The Design of Design Chapter 4}}
}
@article{burrows1990,
author = {Burrows, Michael and Abadi, Martin and Needham, Roger},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Burrows, Abadi, Needham - 1990 - A logic of authentication.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Burrows, Abadi, Needham/Burrows, Abadi, Needham - 1990 - A logic of authentication.pdf:pdf},
journal = {ACM Transactions on Computer Systems},
pages = {18----36},
title = {{A logic of authentication}},
@@ -815,43 +815,63 @@ @misc{TheMendeleySupportTeam2011
address = {London},
author = {{The Mendeley Support Team}},
booktitle = {Mendeley Desktop},
-file = {:Applications/Mendeley Desktop.app/Contents/Resources/FAQ.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/The Mendeley Support Team/The Mendeley Support Team - 2011 - Getting Started with Mendeley.pdf:pdf},
keywords = {Mendeley,how-to,user manual},
pages = {1--16},
publisher = {Mendeley Ltd.},
title = {{Getting Started with Mendeley}},
url = {http://www.mendeley.com},
year = {2011}
}
+@article{mcbride2010ornamental,
+author = {McBride, Conor},
+file = {:Users/edwin/Documents/Mendeley Desktop/McBride/McBride - 2010 - Ornamental algebras, algebraic ornaments.pdf:pdf},
+journal = {Journal of Functional Programming},
+title = {{Ornamental algebras, algebraic ornaments}},
+url = {http://personal.cis.strath.ac.uk/$\sim$conor/pub/OAAO/Ornament.pdf},
+year = {2010}
+}
@misc{Interface2012a,
author = {Kreibich, Jay A.},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Kreibich - Unknown - Using SQLite Chapter 7.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Kreibich/Kreibich - Unknown - Using SQLite Chapter 7.pdf:pdf},
isbn = {9781449394592},
issn = {1478-6729},
pmid = {22215642},
title = {{Using SQLite Chapter 7}}
}
@misc{pollack1997believe,
author = {Pollack, R.},
-file = {:Users/edwin/Documents/Papers/Pollack/1997 Pollack-How to Believe a Machine-Checked.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Pollack/Pollack - 1997 - How to believe a machine-checked proof.pdf:pdf},
title = {{How to believe a machine-checked proof}},
url = {http://books.google.co.uk/books?hl=en&amp;lr=&amp;id=pLnKggT_In4C&amp;oi=fnd&amp;pg=PA205&amp;dq=how+to+believe+a+machine+checked+proof&amp;ots=c2OI8krqqA&amp;sig=EF3QonGFVdOpYdKO1KmW6ljCkjY},
year = {1997}
}
@inproceedings{ko2011modularising,
author = {Ko, H.S. and Gibbons, J.},
booktitle = {Proceedings of the seventh ACM SIGPLAN workshop on Generic programming},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Ko, Gibbons/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
pages = {13--24},
publisher = {ACM},
title = {{Modularising inductive families}},
url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html http://dl.acm.org/citation.cfm?id=2036921},
year = {2011}
}
+@misc{Brady2012c,
+author = {Brooks, Fred},
+doi = {10.1093/epirev/mxr031},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brooks/Brooks - Unknown - The Design of Design Chapter 5.pdf:pdf},
+isbn = {9780321702081},
+issn = {1478-6729},
+number = {1},
+pages = {NP},
+pmid = {22215642},
+title = {{The Design of Design Chapter 5}},
+volume = {34}
+}
@article{mcbride2008functional,
author = {McBride, C. and Paterson, R.},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, Paterson - 2008 - Functional pearl Applicative programming with effects.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/McBride, Paterson/McBride, Paterson - 2008 - Functional pearl Applicative programming with effects.pdf:pdf},
journal = {Journal of functional programming},
number = {1},
pages = {1--13},
@@ -866,7 +886,7 @@ @article{Altenkirch2010
author = {Altenkirch, Thorsten and Danielsson, Nils Anders and L, Andres and Oury, Nicolas},
doi = {10.1007/978-3-642-12251-4_5},
editor = {Blume, Matthias and Kobayashi, Naoki and Vidal, Germ\'{a}n},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch et al. - 2010 - Dependent Types without the Sugar.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Altenkirch et al/Altenkirch et al. - 2010 - Dependent Types without the Sugar.pdf:pdf},
isbn = {9783642122507},
journal = {Computing},
number = {Sheard 2005},
@@ -881,7 +901,7 @@ @article{Altenkirch2010
@inproceedings{morris2006exploring,
author = {Morris, P. and Altenkirch, T. and McBride, C.},
booktitle = {Types for Proofs and Programs},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Morris, Altenkirch, McBride - 2006 - Exploring the regular tree types.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Morris, Altenkirch, McBride/Morris, Altenkirch, McBride - 2006 - Exploring the regular tree types.pdf:pdf},
pages = {252--267},
publisher = {Springer},
title = {{Exploring the regular tree types}},
@@ -893,7 +913,7 @@ @inproceedings{Xi1999
author = {Xi, Hongwei and Pfenning, Frank},
booktitle = {Proceedings of the 26th ACM SIGPLANSIGACT symposium on Principles of programming languages POPL 99},
doi = {10.1145/292540.292560},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Xi, Pfenning - 1999 - Dependent types in practical programming.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Xi, Pfenning/Xi, Pfenning - 1999 - Dependent types in practical programming.pdf:pdf},
isbn = {1581130953},
issn = {07439016},
keywords = {Dependent Types},
@@ -912,7 +932,7 @@ @article{Wadler2001
author = {Wadler, Philip},
doi = {10.1007/3-540-59451-5_2},
editor = {Jeuring, Johan and Meijer, Erik},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Wadler - 2001 - Monads for functional programming.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Wadler/Wadler - 2001 - Monads for functional programming.pdf:pdf},
isbn = {3540594515},
issn = {03029743},
journal = {Advanced Functional Programming},
@@ -925,6 +945,14 @@ @article{Wadler2001
volume = {925},
year = {2001}
}
+@inproceedings{brady2011epic,
+author = {Brady, Edwin},
+booktitle = {Trends in Functional Programming ({TFP}’11)},
+file = {:Users/edwin/Documents/Mendeley Desktop/Brady/Brady - 2011 - Epic --- A Library for Generating Compilers.pdf:pdf},
+title = {{Epic --- A Library for Generating Compilers}},
+url = {http://scholar.google.co.uk/scholar?cites=2588300990390214449&as_sdt=2005&sciodt=0,5&hl=en#1},
+year = {2011}
+}
@inproceedings{taha2004gentle,
author = {Taha, W.},
booktitle = {Domain-Specific Program Generation},
@@ -934,10 +962,22 @@ @inproceedings{taha2004gentle
url = {http://www.springerlink.com/index/JEMT0D8VYN5JB2L8.pdf},
year = {2004}
}
+@inproceedings{chlipala2010ur,
+author = {Chlipala, Adam},
+booktitle = {ACM SIGPLAN Notices},
+file = {:Users/edwin/Documents/Mendeley Desktop/Chlipala/Chlipala - 2010 - Ur statically-typed metaprogramming with type-level record computation.pdf:pdf},
+number = {6},
+pages = {122--133},
+publisher = {ACM},
+title = {{Ur: statically-typed metaprogramming with type-level record computation}},
+url = {http://dl.acm.org/citation.cfm?id=1806612},
+volume = {45},
+year = {2010}
+}
@inproceedings{McBride2004b,
author = {McBride, Conor and McKinna, James},
booktitle = {Haskell Workshop},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, McKinna - 2004 - I am not a number I am a free variable.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/McBride, McKinna/McBride, McKinna - 2004 - I am not a number I am a free variable.pdf:pdf},
title = {{I am not a number : I am a free variable}},
year = {2004}
}
@@ -952,17 +992,29 @@ @inproceedings{fisher2005pads
volume = {40},
year = {2005}
}
+@article{loh2010tutorial,
+author = {L\"{o}h, A. and McBride, C. and Swierstra, W.},
+file = {:Users/edwin/Documents/Mendeley Desktop/L\"{o}h, McBride, Swierstra/L\"{o}h, McBride, Swierstra - 2010 - A tutorial implementation of a dependently typed lambda calculus.pdf:pdf},
+journal = {Fundamenta Informaticae},
+number = {2},
+pages = {177--207},
+publisher = {IOS Press},
+title = {{A tutorial implementation of a dependently typed lambda calculus}},
+url = {http://iospress.metapress.com/index/976W4716TM79M6U8.pdf},
+volume = {102},
+year = {2010}
+}
@article{Okasaki1993,
author = {Okasaki, Chris},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Okasaki - 1993 - Red-Black Trees in A Functional Setting.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Okasaki/Okasaki - 1993 - Red-Black Trees in A Functional Setting.pdf:pdf},
journal = {Journal of functional programming},
title = {{Red-Black Trees in A Functional Setting}},
year = {1993}
}
@misc{Attacks2012a,
author = {Anderson, Ross},
doi = {10.1093/epirev/mxr031},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Anderson - Unknown - Security Engineering Chapter 18.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Anderson/Anderson - Unknown - Security Engineering Chapter 18.pdf:pdf},
isbn = {9780470068526},
issn = {1478-6729},
number = {1},
@@ -975,7 +1027,7 @@ @article{Xi1998
abstract = {We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can still be performed efficiently in practice. We illustrate our approach through concrete examples and present the result of our preliminary experiments which support support the feasibility and effectiveness of our approach.},
author = {Xi, Hongwei and Pfenning, Frank},
doi = {10.1145/277652.277732},
-file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Xi, Pfenning - 1998 - Eliminating array bound checking through dependent types.pdf:pdf},
+file = {:Users/edwin/Documents/Mendeley Desktop/Xi, Pfenning/Xi, Pfenning - 1998 - Eliminating array bound checking through dependent types.pdf:pdf},
isbn = {0897919874},
issn = {03621340},
journal = {ACM Sigplan Notices},
View
4 impl-paper/macros.ltx
@@ -116,6 +116,10 @@
\newcommand{\RW}[1]{\underline{\textrm{#1}}}
\newcommand{\MO}[1]{\mbox{\textsc{#1}}}
+\newcommand{\tTC}[1]{\texttt{#1}}
+\newcommand{\tDC}[1]{\texttt{#1}}
+\newcommand{\tFN}[1]{\texttt{#1}}
+
\newcommand{\HF}[1]{\mathtt{#1}}
\newcommand{\MV}[1]{\nhole\mathit{#1}}
View
31 impl-paper/typechecking.tex
@@ -1,6 +1,19 @@
\section{The Core Type Theory}
-\DM{
+High level \Idris{} programs, as described in Section \ref{sect:hll} are
+\remph{elaborated} to a small core language, \TT{}, then type checked. We keep the
+core language as small as is reasonable. This has several advantages: it is
+easy to type check, since type checking dependent type theory is well understood
+~\cite{loh2010tutorial}; and it is easy to transform, optimise and compile. Keeping
+the language small increases our confidence that these important components of
+the language are correct. In this section, we describe \TT{} and
+its semantics.
+
+\subsection{\TT{} syntax}
+
+The syntax of \TT{} expressions is given in Figure \ref{ttsyn}.
+
+\FFIG{
\begin{array}{rll@{\hg}|rll}
\vt ::= & \Type_i & (\mbox{type universes}) &
\hg\vb ::= & \lam{\vx}{\vt} & (\mbox{abstraction}) \\
@@ -15,4 +28,20 @@ \section{The Core Type Theory}
\end{array}
}
+{\TT{} expression syntax}
+{ttsyn}
+
+\subsection{Evaluation rules}
+
+\subsection{Typing rules}
+
+\subsection{The Development Calculus \TTdev}
+
+\TTdev{} is \TT{} extended with hole binders, Oleg-style~\cite{McBride1999}.
+
+\subsection{The $\MO{Elab}$ meta-language}
+
+\begin{itemize}
+\item $\MO{Check}\:\vt\:\cq\:(\vt, \vt)$
+\end{itemize}
View
2 tutorial/classes.tex
@@ -138,7 +138,7 @@ \subsection{Extending Classes}
Classes can also be extended. A logical next step from an equality relation \texttt{Eq}
is to define an ordering relation \texttt{Ord}. We can define an \texttt{Ord} class
-which inherits method from \texttt{Eq} as well as defining some of its own:
+which inherits methods from \texttt{Eq} as well as defining some of its own:
\begin{SaveVerbatim}{ord}
View
2 tutorial/intro.tex
@@ -46,7 +46,7 @@ \section{Introduction}
This tutorial introduces \Idris{}, a general purpose functional
programming language with dependent types.
The goal of the \Idris{} project is to build a dependently typed language suitable
-for verifable \emph{systems} programming. To this end, \Idris{} is a compiled language
+for verifiable \emph{systems} programming. To this end, \Idris{} is a compiled language
which aims to generate efficient executable code. It also has a lightweight foreign
function interface which allows easy interaction with external C libraries.
View
2 tutorial/miscellany.tex
@@ -10,7 +10,7 @@ \subsection{Auto implicit arguments}
We have already seen implicit arguments, which allows arguments to be omitted when
they can be inferred by the type checker, e.g.
-\useverb{vlookupimpty}
+\useverb{vindeximpty}
\noindent
In other situations, it may be possible to infer arguments not by type checking but
View
54 tutorial/typesfuns.tex
@@ -97,15 +97,15 @@ \subsection{Data Types}
\begin{SaveVerbatim}{infixcons}
-infixr 7 ::
+infixr 10 ::
\end{SaveVerbatim}
\useverb{infixcons}
\noindent
Functions, data constructors and type constuctors may all be given infix
operators as names. They may be used in prefix form if enclosed in brackets,
-e.g. (::). Infix operators can use any of the symbols:
+e.g. \tDC{(::)}. Infix operators can use any of the symbols:
\begin{SaveVerbatim}{infixsyms}
@@ -150,7 +150,7 @@ \subsection{Functions}
\tDC{Nil} and \tDC{::}) and type constructors (\tTC{Nat} and \tTC{List}) are
all part of the same namespace.
-We can test these functions at the Idris prompt:
+We can test these functions at the \Idris{} prompt:
\begin{SaveVerbatim}{fntest}
@@ -254,7 +254,7 @@ \subsubsection{Vectors}
argument, where \tTC{Set} stands for the type of types. We say that \tTC{Vect}
is \emph{parameterised} by a type, and \emph{indexed} over \tTC{Nat}. Each
constructor targets a different part of the family of types. \tDC{Nil} can only
-be used to construct vectors with zero length, and \tDC{::} to constructor
+be used to construct vectors with zero length, and \tDC{::} to construct
vectors with non-zero length. In the type of \tDC{::}, we state explicitly that an element
of type \texttt{a} and a tail of type \texttt{Vect a k} (i.e., a vector of length \texttt{k})
combine to make a vector of length \texttt{S k}.
@@ -275,7 +275,7 @@ \subsubsection{Vectors}
\useverb{vapp}
\noindent
-The type of \tFN{app} states that the resulting vector's length will be the sum of
+The type of \tFN{(++)} states that the resulting vector's length will be the sum of
the input lengths. If we get the definition wrong in such a way that this does
not hold, \Idris{} will not accept the definition. For example:
@@ -339,14 +339,14 @@ \subsubsection{The Finite Sets}
For example, the following function which looks up an element in a \tTC{Vect},
by a bounded index given as a \tTC{Fin n}, is defined in the prelude:
-\begin{SaveVerbatim}{vlookup}
+\begin{SaveVerbatim}{vindex}
-lookup : Fin n -> Vect a n -> a
-lookup fO (x :: xs) = x
-lookup (fS k) (x :: xs) = lookup k xs
+index : Fin n -> Vect a n -> a
+index fO (x :: xs) = x
+index (fS k) (x :: xs) = index k xs
\end{SaveVerbatim}
-\useverb{vlookup}
+\useverb{vindex}
\noindent
This function looks up a value at a given location in a vector. The location is
@@ -362,54 +362,54 @@ \subsubsection{The Finite Sets}
\subsubsection{Implicit Arguments}
-Let us take a closer look at the type of \texttt{lookup}:
+Let us take a closer look at the type of \texttt{index}:
-\begin{SaveVerbatim}{vlookupty}
+\begin{SaveVerbatim}{vindexty}
-lookup : Fin n -> Vect a n -> a
+index : Fin n -> Vect a n -> a
\end{SaveVerbatim}
-\useverb{vlookupty}
+\useverb{vindexty}
\noindent
It takes two arguments, an element of the finite set of \texttt{n} elements, and a vector
with \texttt{n} elements of type \texttt{a}. But there are also two names,
\texttt{n} and \texttt{a}, which are not declared explictly. These are \emph{implicit}
-arguments to \texttt{lookup}. We could also write the type of \texttt{lookup} as:
+arguments to \texttt{index}. We could also write the type of \texttt{index} as:
-\begin{SaveVerbatim}{vlookupimpty}
+\begin{SaveVerbatim}{vindeximpty}
-lookup : {a:Set} -> {n:Nat} -> Fin n -> Vect a n -> a
+index : {a:Set} -> {n:Nat} -> Fin n -> Vect a n -> a
\end{SaveVerbatim}
-\useverb{vlookupimpty}
+\useverb{vindeximpty}
\noindent
Implicit arguments, given in braces \texttt{\{\}} in the type declaration, are not given in
-applications of \texttt{lookup}; their values can be inferred from the types of
+applications of \texttt{index}; their values can be inferred from the types of
the \texttt{Fin n} and \texttt{Vect a n} arguments. Any name which appears as a parameter
or index in a type declaration, but which is otherwise free, will be automatically
bound as an implicit argument.
Implicit arguments can still be given explicitly in applications, using
-{a=value} and {n=value}, for example:
+\texttt{\{a=value\}} and \texttt{\{n=value\}}, for example:
-\begin{SaveVerbatim}{vlookupexp}
+\begin{SaveVerbatim}{vindexexp}
-lookup {a=Int} {n=2} fO (2 :: 3 :: Nil)
+index {a=Int} {n=2} fO (2 :: 3 :: Nil)
\end{SaveVerbatim}
-\useverb{vlookupexp}
+\useverb{vindexexp}
\noindent
In fact, any argument, implicit or explicit, may be given a name. We could have
-declared the type of \texttt{lookup} as:
+declared the type of \texttt{index} as:
-\begin{SaveVerbatim}{vlookupn}
+\begin{SaveVerbatim}{vindexn}
-lookup : (i:Fin n) -> (xs:Vect a n) -> a
+index : (i:Fin n) -> (xs:Vect a n) -> a
\end{SaveVerbatim}
-\useverb{vlookupn}
+\useverb{vindexn}
\noindent
It is a matter of taste whether you want to do this --- sometimes it can help

0 comments on commit 0af8a2e

Please sign in to comment.
Something went wrong with that request. Please try again.