11 
Linearity and lazinessWakeling, David January 1990 (has links)
No description available.

12 
Semantics and type checking of dependentlytyped lazy functional programs /Hünke, Yorck. January 2004 (has links)
Based on the author's D. Phil. Thesis (University of Oxford). / Includes bibliographical references. Available online.

13 
Prooftheoretic investigations into integrated logical and functional programmingPinto, Luis Filipe Ribeiro January 1997 (has links)
This thesis is a prooftheoretic investigation of logic programming based on hereditary Harrop logic (as in lambdaProlog). After studying various proof systems for the firstorder hereditary Harrop logic, we define the prooftheoretic semantics of a logic LFPL, intended as the basis of logic programming with functions, which extends higherorder hereditary Harrop logic by providing definition mechanisms for functions in such a way that the logical specification of the function rather than the function may be used in proof search. In Chap. 3, we define, for the firstorder hereditary Harrop fragment of LJ, the class of uniform linear focused (ULF) proofs (suitable for goaldirected search with backchaining and unification) and show that the ULFproofs are in 11 correspondence with the expanded normal deductions, in Prawitz's sense. We give a system of proofterm annotations for LJproofs (where proofterms uniquely represent proofs). We define a rewriting system on proofterms (where rules represent a subset of Kleene's permutations in LJ) and show that: its irreducible proof terms are those representing ULFproofs; it is weakly normalising. We also show that the composition of Prawitz's mappings between LJ and NJ, restricted to ULFproofs, is the identity. We take the view of logic programming where: a program P is a set of formulae; a goal G is a formula; and the different means of achieving G w.r.t. P correspond to the expanded normal deductions of G from the assumptions in P (rather than the traditional view, whereby the different means of goalachievement correspond to the different answer substitutions). LFPL is defined in Chap. 4, by means of a sequent calculus. As in LeFun, it extends logic programming with functions and provides mechanisms for defining names for functions, maintaining proof search as the computation mechanism (contrary to languages such as ALF, Babel, Curry and Escher, based on equational logic, where the computation mechanism is some form of rewriting). LFPL also allows definitions for declaring logical properties of functions, called definitions of dependent type. Such definitions are of the form: (f,x) =def(A, w) : EX:RF, where f is a name for A and x is a name for w, a proofterm witnessing that the formula [A/x]F holds (i.e. A meets the specification Ex:rF). When searching for proofs, it may suffice to use the formula [A/x]F rather than A itself. We present an interpretation of LFPL into NNlambdanorm, a natural deduction system for hereditary Harrop logic with lambdaterms. The means of goalachievement in LFPL are interpreted in NNlambdanorm essentially by cutelimination, followed by an interpretation of cutfree sequent calculus proofs as normal deductions. We show that the use of definitions of dependent type may speed up proof search because the equivalent proofs using no such definitions may be much longer and because normalisation may be done lazily, since not all parts of the proof need to be exhibited. We sketch two methods for implementing LFPL, based on goaldirected proof search, differing in the mechanism for selecting definitions of dependent type on which to backchain. We discuss techniques for handling the redundancy arising from the equivalence of each proof using such a definition to one using no such definitions.

14 
Exploiting data parallelism in artificial neural networks with HaskellHeartsfield, Gregory Lynn 2009 August 1900 (has links)
Functional parallel programming techniques for feedforward artiﬁcial neural networks trained using backpropagation learning are analyzed. In particular, the Data Parallel Haskell extension to the Glasgow Haskell Compiler is considered as a tool for achieving data parallelism. We ﬁnd much potential and elegance in this method, and determine that a suﬃciently large workload is critical in achieving real gains. Several additional features are recommended to increase usability and improve results on small datasets. / text

15 
Higher order strictness analysis by abstract interpretation over finite domainsFerguson, Alexander B. January 1995 (has links)
No description available.

16 
The geometry of interaction as a theory of cut elimination with structuresharingEastaughffe, Katherine A. January 1995 (has links)
No description available.

17 
The Revised Revised Report on Scheme or An Uncommon LispClinger, William 01 August 1985 (has links)
Data and procedures and the values they amass, Higherorder functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch In the Lambda Order they are all firstclass. One thing to name them all, one things to define them, one thing to place them in environments and bind them, in the Lambda Order they are all firstclass. Keywords: SCHEME, LISP, functional programming, computer languages.

18 
The Role of Programming in the Formulation of IdeasSussman, Gerald Jay, Wisdom, Jack 01 November 2002 (has links)
Classical mechanics is deceptively simple. It is surprisingly easy to get the right answer with fallacious reasoning or without real understanding. To address this problem we use computational techniques to communicate a deeper understanding of Classical Mechanics. Computational algorithms are used to express the methods used in the analysis of dynamical phenomena. Expressing the methods in a computer language forces them to be unambiguous and computationally effective. The task of formulating a method as a computerexecutable program and debugging that program is a powerful exercise in the learning process. Also, once formalized procedurally, a mathematical idea becomes a tool that can be used directly to compute results.

19 
From ALPHA to imperative code : a transformational compiler for an array based functional language /Wilde, Doran K. January 1900 (has links)
Thesis (Ph. D.)Oregon State University, 1996. / Typescript (photocopy). Includes bibliographical references (leaves 144152). Also available on the World Wide Web.

20 
Parallel programming using functional languagesRoe, Paul. January 1991 (has links)
Thesis (Ph.D.)  University of Glasgow, 1991. / Print version also available. Mode of access : World Wide Web. System requirements : Adobe Acrobat reader required to view PDF document.

Page generated in 0.1472 seconds