Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(functional programming). Showing records 1 – 30 of 199 total matches.

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


Rochester Institute of Technology

1. Amsden, Edward. Timeflies: Push-pull signal-function functional reactive programming.

Degree: Computer Science (GCCIS), 2013, Rochester Institute of Technology

Functional Reactive Programming (FRP) is a promising class of abstractions for interactive programs. FRP systems provide values defined at all points in time (behaviors… (more)

Subjects/Keywords: Functional programming; Functional reactive programming; Programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Amsden, E. (2013). Timeflies: Push-pull signal-function functional reactive programming. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5512

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Amsden, Edward. “Timeflies: Push-pull signal-function functional reactive programming.” 2013. Thesis, Rochester Institute of Technology. Accessed December 03, 2020. https://scholarworks.rit.edu/theses/5512.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Amsden, Edward. “Timeflies: Push-pull signal-function functional reactive programming.” 2013. Web. 03 Dec 2020.

Vancouver:

Amsden E. Timeflies: Push-pull signal-function functional reactive programming. [Internet] [Thesis]. Rochester Institute of Technology; 2013. [cited 2020 Dec 03]. Available from: https://scholarworks.rit.edu/theses/5512.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Amsden E. Timeflies: Push-pull signal-function functional reactive programming. [Thesis]. Rochester Institute of Technology; 2013. Available from: https://scholarworks.rit.edu/theses/5512

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Oxford

2. Harper, Thomas. Theory and practice of shortcut fusion.

Degree: PhD, 2013, University of Oxford

 There are a number of approaches for eliminating intermediate data structures in functional programs by rewriting a composition of recursive functions as a single recursive… (more)

Subjects/Keywords: Functional programming (Computer science); Functional programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Harper, T. (2013). Theory and practice of shortcut fusion. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:0b493c43-3b85-4e3a-a844-01ac4a45c11b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770324

Chicago Manual of Style (16th Edition):

Harper, Thomas. “Theory and practice of shortcut fusion.” 2013. Doctoral Dissertation, University of Oxford. Accessed December 03, 2020. http://ora.ox.ac.uk/objects/uuid:0b493c43-3b85-4e3a-a844-01ac4a45c11b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770324.

MLA Handbook (7th Edition):

Harper, Thomas. “Theory and practice of shortcut fusion.” 2013. Web. 03 Dec 2020.

Vancouver:

Harper T. Theory and practice of shortcut fusion. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2020 Dec 03]. Available from: http://ora.ox.ac.uk/objects/uuid:0b493c43-3b85-4e3a-a844-01ac4a45c11b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770324.

Council of Science Editors:

Harper T. Theory and practice of shortcut fusion. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:0b493c43-3b85-4e3a-a844-01ac4a45c11b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770324


Tampere University

3. Salmi, Enni. Comparing the Use of a Purely Functional Programming Language to Event-driven JavaScript in Modern Web Application Development .

Degree: 2020, Tampere University

 The functional programming paradigm has gained some popularity in the field of web development during the past few years, yet no functional programming language is… (more)

Subjects/Keywords: functional programming ; event-driven programming ; Elm ; JavaScript

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Salmi, E. (2020). Comparing the Use of a Purely Functional Programming Language to Event-driven JavaScript in Modern Web Application Development . (Masters Thesis). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/121287

Chicago Manual of Style (16th Edition):

Salmi, Enni. “Comparing the Use of a Purely Functional Programming Language to Event-driven JavaScript in Modern Web Application Development .” 2020. Masters Thesis, Tampere University. Accessed December 03, 2020. https://trepo.tuni.fi/handle/10024/121287.

MLA Handbook (7th Edition):

Salmi, Enni. “Comparing the Use of a Purely Functional Programming Language to Event-driven JavaScript in Modern Web Application Development .” 2020. Web. 03 Dec 2020.

Vancouver:

Salmi E. Comparing the Use of a Purely Functional Programming Language to Event-driven JavaScript in Modern Web Application Development . [Internet] [Masters thesis]. Tampere University; 2020. [cited 2020 Dec 03]. Available from: https://trepo.tuni.fi/handle/10024/121287.

Council of Science Editors:

Salmi E. Comparing the Use of a Purely Functional Programming Language to Event-driven JavaScript in Modern Web Application Development . [Masters Thesis]. Tampere University; 2020. Available from: https://trepo.tuni.fi/handle/10024/121287


University of Adelaide

4. Kelly, Peter M. Applying functional programming theory to the design of workflow engines.

Degree: 2011, University of Adelaide

 Workflow languages are a form of high-level programming language designed for coordinating tasks implemented by different pieces of soft-ware, often executed across multiple computers using… (more)

Subjects/Keywords: functional programming; workflow; distributed computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kelly, P. M. (2011). Applying functional programming theory to the design of workflow engines. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/65938

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kelly, Peter M. “Applying functional programming theory to the design of workflow engines.” 2011. Thesis, University of Adelaide. Accessed December 03, 2020. http://hdl.handle.net/2440/65938.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kelly, Peter M. “Applying functional programming theory to the design of workflow engines.” 2011. Web. 03 Dec 2020.

Vancouver:

Kelly PM. Applying functional programming theory to the design of workflow engines. [Internet] [Thesis]. University of Adelaide; 2011. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2440/65938.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kelly PM. Applying functional programming theory to the design of workflow engines. [Thesis]. University of Adelaide; 2011. Available from: http://hdl.handle.net/2440/65938

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Leicester

5. Whitington, John. Debugging functional programs by interpretation.

Degree: PhD, 2020, University of Leicester

 Motivated by experience in programming and in the teaching of programming, we make another assault on the longstanding problem of debugging. Having explored why debuggers… (more)

Subjects/Keywords: Debugging; Interpretation; functional programming environment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Whitington, J. (2020). Debugging functional programs by interpretation. (Doctoral Dissertation). University of Leicester. Retrieved from https://doi.org/10.25392/leicester.data.12696617.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.811487

Chicago Manual of Style (16th Edition):

Whitington, John. “Debugging functional programs by interpretation.” 2020. Doctoral Dissertation, University of Leicester. Accessed December 03, 2020. https://doi.org/10.25392/leicester.data.12696617.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.811487.

MLA Handbook (7th Edition):

Whitington, John. “Debugging functional programs by interpretation.” 2020. Web. 03 Dec 2020.

Vancouver:

Whitington J. Debugging functional programs by interpretation. [Internet] [Doctoral dissertation]. University of Leicester; 2020. [cited 2020 Dec 03]. Available from: https://doi.org/10.25392/leicester.data.12696617.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.811487.

Council of Science Editors:

Whitington J. Debugging functional programs by interpretation. [Doctoral Dissertation]. University of Leicester; 2020. Available from: https://doi.org/10.25392/leicester.data.12696617.v1 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.811487


Macquarie University

6. Roberts, Matthew. Compiled generics for functional programming languages.

Degree: 2011, Macquarie University

"This dissertation is presented for the degree of Doctor of Philosophy".

"March 2011"

Bibliography: pages 183-190.

1. Introduction  – 2. Generic functions  – 3. Encoding… (more)

Subjects/Keywords: Functional programming languages; Functional programming (Computer science); Computer architecture; Compilers (Computer programs); Language compilers; Functional programming; Programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Roberts, M. (2011). Compiled generics for functional programming languages. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/337819

Chicago Manual of Style (16th Edition):

Roberts, Matthew. “Compiled generics for functional programming languages.” 2011. Doctoral Dissertation, Macquarie University. Accessed December 03, 2020. http://hdl.handle.net/1959.14/337819.

MLA Handbook (7th Edition):

Roberts, Matthew. “Compiled generics for functional programming languages.” 2011. Web. 03 Dec 2020.

Vancouver:

Roberts M. Compiled generics for functional programming languages. [Internet] [Doctoral dissertation]. Macquarie University; 2011. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1959.14/337819.

Council of Science Editors:

Roberts M. Compiled generics for functional programming languages. [Doctoral Dissertation]. Macquarie University; 2011. Available from: http://hdl.handle.net/1959.14/337819


Portland State University

7. Morris, John Garrett. Type Classes and Instance Chains: A Relational Approach.

Degree: PhD, Computer Science, 2013, Portland State University

  Type classes, first proposed during the design of the Haskell programming language, extend standard type systems to support overloaded functions. Since their introduction, type… (more)

Subjects/Keywords: Functional programming languages; Haskell (Computer program language); Functional programming (Computer science); Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Morris, J. G. (2013). Type Classes and Instance Chains: A Relational Approach. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/1010

Chicago Manual of Style (16th Edition):

Morris, John Garrett. “Type Classes and Instance Chains: A Relational Approach.” 2013. Doctoral Dissertation, Portland State University. Accessed December 03, 2020. https://pdxscholar.library.pdx.edu/open_access_etds/1010.

MLA Handbook (7th Edition):

Morris, John Garrett. “Type Classes and Instance Chains: A Relational Approach.” 2013. Web. 03 Dec 2020.

Vancouver:

Morris JG. Type Classes and Instance Chains: A Relational Approach. [Internet] [Doctoral dissertation]. Portland State University; 2013. [cited 2020 Dec 03]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/1010.

Council of Science Editors:

Morris JG. Type Classes and Instance Chains: A Relational Approach. [Doctoral Dissertation]. Portland State University; 2013. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/1010


University of Edinburgh

8. Fowler, Simon John. Typed concurrent functional programming with channels, actors and sessions.

Degree: PhD, 2019, University of Edinburgh

 The age of writing single-threaded applications is over. To develop scalable applications, developers must make use of concurrency and parallelism. Nonetheless, introducing concurrency and parallelism… (more)

Subjects/Keywords: session types; functional programming; concurrent programming; lambda calculus; programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fowler, S. J. (2019). Typed concurrent functional programming with channels, actors and sessions. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/35873

Chicago Manual of Style (16th Edition):

Fowler, Simon John. “Typed concurrent functional programming with channels, actors and sessions.” 2019. Doctoral Dissertation, University of Edinburgh. Accessed December 03, 2020. http://hdl.handle.net/1842/35873.

MLA Handbook (7th Edition):

Fowler, Simon John. “Typed concurrent functional programming with channels, actors and sessions.” 2019. Web. 03 Dec 2020.

Vancouver:

Fowler SJ. Typed concurrent functional programming with channels, actors and sessions. [Internet] [Doctoral dissertation]. University of Edinburgh; 2019. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1842/35873.

Council of Science Editors:

Fowler SJ. Typed concurrent functional programming with channels, actors and sessions. [Doctoral Dissertation]. University of Edinburgh; 2019. Available from: http://hdl.handle.net/1842/35873


KTH

9. Sandström, Jesper. Functional and Reactive Patterns in Idiomatically Imperative Programming Languages.

Degree: Electrical Engineering and Computer Science (EECS), 2018, KTH

Functional and reactive programming patterns provide powerful sets of tools for dealing with complexity and scalability. These stand in stark contrast to the imperative… (more)

Subjects/Keywords: Functional Programming; Reactive Programming; Software Architecture; Programming patterns; Programming Paradigms; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sandström, J. (2018). Functional and Reactive Patterns in Idiomatically Imperative Programming Languages. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231426

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sandström, Jesper. “Functional and Reactive Patterns in Idiomatically Imperative Programming Languages.” 2018. Thesis, KTH. Accessed December 03, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231426.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sandström, Jesper. “Functional and Reactive Patterns in Idiomatically Imperative Programming Languages.” 2018. Web. 03 Dec 2020.

Vancouver:

Sandström J. Functional and Reactive Patterns in Idiomatically Imperative Programming Languages. [Internet] [Thesis]. KTH; 2018. [cited 2020 Dec 03]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231426.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sandström J. Functional and Reactive Patterns in Idiomatically Imperative Programming Languages. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231426

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rochester Institute of Technology

10. Le, Matthew. Partial Aborts for Transactions via First Class Continuations.

Degree: MS, Computer Science (GCCIS), 2016, Rochester Institute of Technology

  Software transactional memory (STM) has proven to be a useful abstraction for developing concurrent applications where programmers denote transactions with an atomic construct that… (more)

Subjects/Keywords: Concurrency; Functional programming; Software transactional memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Le, M. (2016). Partial Aborts for Transactions via First Class Continuations. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9170

Chicago Manual of Style (16th Edition):

Le, Matthew. “Partial Aborts for Transactions via First Class Continuations.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed December 03, 2020. https://scholarworks.rit.edu/theses/9170.

MLA Handbook (7th Edition):

Le, Matthew. “Partial Aborts for Transactions via First Class Continuations.” 2016. Web. 03 Dec 2020.

Vancouver:

Le M. Partial Aborts for Transactions via First Class Continuations. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2020 Dec 03]. Available from: https://scholarworks.rit.edu/theses/9170.

Council of Science Editors:

Le M. Partial Aborts for Transactions via First Class Continuations. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/9170


University of Utah

11. Kraybill, Matthew L. Motor programming and the prediction of everyday functioning.

Degree: PhD, Physiology;, 2010, University of Utah

 The purpose of this study was to examine cognitive reserve, level of cognitive functioning, and motor programming as early markers for detecting declines in everyday… (more)

Subjects/Keywords: Executive functioning; Functional independence; Motor programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kraybill, M. L. (2010). Motor programming and the prediction of everyday functioning. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/1887/rec/791

Chicago Manual of Style (16th Edition):

Kraybill, Matthew L. “Motor programming and the prediction of everyday functioning.” 2010. Doctoral Dissertation, University of Utah. Accessed December 03, 2020. http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/1887/rec/791.

MLA Handbook (7th Edition):

Kraybill, Matthew L. “Motor programming and the prediction of everyday functioning.” 2010. Web. 03 Dec 2020.

Vancouver:

Kraybill ML. Motor programming and the prediction of everyday functioning. [Internet] [Doctoral dissertation]. University of Utah; 2010. [cited 2020 Dec 03]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/1887/rec/791.

Council of Science Editors:

Kraybill ML. Motor programming and the prediction of everyday functioning. [Doctoral Dissertation]. University of Utah; 2010. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/1887/rec/791


University of Windsor

12. St. Amour, Bryan Gary. A Subjective Logic Library Constructed Using Monadic Higher Order Functions.

Degree: MS, Computer Science, 2014, University of Windsor

  Subjective Logic is a recently emergent probabilistic logic system that allows for reasoning under uncertainty. Though algebraically expressive, there is a lack of software… (more)

Subjects/Keywords: Automated Reasoning; Functional Programming; Software Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

St. Amour, B. G. (2014). A Subjective Logic Library Constructed Using Monadic Higher Order Functions. (Masters Thesis). University of Windsor. Retrieved from http://scholar.uwindsor.ca/etd/5187

Chicago Manual of Style (16th Edition):

St. Amour, Bryan Gary. “A Subjective Logic Library Constructed Using Monadic Higher Order Functions.” 2014. Masters Thesis, University of Windsor. Accessed December 03, 2020. http://scholar.uwindsor.ca/etd/5187.

MLA Handbook (7th Edition):

St. Amour, Bryan Gary. “A Subjective Logic Library Constructed Using Monadic Higher Order Functions.” 2014. Web. 03 Dec 2020.

Vancouver:

St. Amour BG. A Subjective Logic Library Constructed Using Monadic Higher Order Functions. [Internet] [Masters thesis]. University of Windsor; 2014. [cited 2020 Dec 03]. Available from: http://scholar.uwindsor.ca/etd/5187.

Council of Science Editors:

St. Amour BG. A Subjective Logic Library Constructed Using Monadic Higher Order Functions. [Masters Thesis]. University of Windsor; 2014. Available from: http://scholar.uwindsor.ca/etd/5187


Rhodes University

13. Mountjoy, Jon-Dean. Static analysis of functional languages.

Degree: Faculty of Science, Computer Science, 1994, Rhodes University

Static analysis is the name given to a number of compile time analysis techniques used to automatically generate information which can lead to improvements in… (more)

Subjects/Keywords: Functional programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mountjoy, J. (1994). Static analysis of functional languages. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1006690

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mountjoy, Jon-Dean. “Static analysis of functional languages.” 1994. Thesis, Rhodes University. Accessed December 03, 2020. http://hdl.handle.net/10962/d1006690.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mountjoy, Jon-Dean. “Static analysis of functional languages.” 1994. Web. 03 Dec 2020.

Vancouver:

Mountjoy J. Static analysis of functional languages. [Internet] [Thesis]. Rhodes University; 1994. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10962/d1006690.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mountjoy J. Static analysis of functional languages. [Thesis]. Rhodes University; 1994. Available from: http://hdl.handle.net/10962/d1006690

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rhodes University

14. Graham, Gwyneth Clare. An investigation of nondeterminism in functional programming languages.

Degree: Faculty of Science, Computer Science, 1997, Rhodes University

 This thesis investigates nondeterminism in functional programming languages. To establish a precise understanding of nondeterministic language properties, Sondergaard and Sestoft's analysis and definitions of functional(more)

Subjects/Keywords: Functional programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Graham, G. C. (1997). An investigation of nondeterminism in functional programming languages. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1006658

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Graham, Gwyneth Clare. “An investigation of nondeterminism in functional programming languages.” 1997. Thesis, Rhodes University. Accessed December 03, 2020. http://hdl.handle.net/10962/d1006658.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Graham, Gwyneth Clare. “An investigation of nondeterminism in functional programming languages.” 1997. Web. 03 Dec 2020.

Vancouver:

Graham GC. An investigation of nondeterminism in functional programming languages. [Internet] [Thesis]. Rhodes University; 1997. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10962/d1006658.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Graham GC. An investigation of nondeterminism in functional programming languages. [Thesis]. Rhodes University; 1997. Available from: http://hdl.handle.net/10962/d1006658

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Colorado State University

15. Segreto, Steve. Garbage elimination in SA-C host code.

Degree: MS(M.S.), Computer Science, 2001, Colorado State University

 Single-assignment C (SA-C) is a functional programming language with a rich instruction set designed to create and manipulate arrays using array slices and window generators.… (more)

Subjects/Keywords: Functional programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Segreto, S. (2001). Garbage elimination in SA-C host code. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/90225

Chicago Manual of Style (16th Edition):

Segreto, Steve. “Garbage elimination in SA-C host code.” 2001. Masters Thesis, Colorado State University. Accessed December 03, 2020. http://hdl.handle.net/10217/90225.

MLA Handbook (7th Edition):

Segreto, Steve. “Garbage elimination in SA-C host code.” 2001. Web. 03 Dec 2020.

Vancouver:

Segreto S. Garbage elimination in SA-C host code. [Internet] [Masters thesis]. Colorado State University; 2001. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10217/90225.

Council of Science Editors:

Segreto S. Garbage elimination in SA-C host code. [Masters Thesis]. Colorado State University; 2001. Available from: http://hdl.handle.net/10217/90225


Tampere University

16. Nieminen, Matti. Executable formal specifications with Clojure .

Degree: 2015, Tampere University

 In software projects, where formal specifications are utilized, programmers usually need to know separate languages and tools for tasks related to programming and formal specifications.… (more)

Subjects/Keywords: functional programming; Clojure; executable formal specifications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nieminen, M. (2015). Executable formal specifications with Clojure . (Masters Thesis). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/97597

Chicago Manual of Style (16th Edition):

Nieminen, Matti. “Executable formal specifications with Clojure .” 2015. Masters Thesis, Tampere University. Accessed December 03, 2020. https://trepo.tuni.fi/handle/10024/97597.

MLA Handbook (7th Edition):

Nieminen, Matti. “Executable formal specifications with Clojure .” 2015. Web. 03 Dec 2020.

Vancouver:

Nieminen M. Executable formal specifications with Clojure . [Internet] [Masters thesis]. Tampere University; 2015. [cited 2020 Dec 03]. Available from: https://trepo.tuni.fi/handle/10024/97597.

Council of Science Editors:

Nieminen M. Executable formal specifications with Clojure . [Masters Thesis]. Tampere University; 2015. Available from: https://trepo.tuni.fi/handle/10024/97597


Columbia University

17. Townsend, Richard Morse. Compiling Irregular Software to Specialized Hardware.

Degree: 2019, Columbia University

 High-level synthesis (HLS) has simplified the design process for energy-efficient hardware accelerators: a designer specifies an accelerator’s behavior in a “high-level” language, and a toolchain… (more)

Subjects/Keywords: Computer science; Hardware; Algorithms; Functional programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Townsend, R. M. (2019). Compiling Irregular Software to Specialized Hardware. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/d8-4yxc-gz97

Chicago Manual of Style (16th Edition):

Townsend, Richard Morse. “Compiling Irregular Software to Specialized Hardware.” 2019. Doctoral Dissertation, Columbia University. Accessed December 03, 2020. https://doi.org/10.7916/d8-4yxc-gz97.

MLA Handbook (7th Edition):

Townsend, Richard Morse. “Compiling Irregular Software to Specialized Hardware.” 2019. Web. 03 Dec 2020.

Vancouver:

Townsend RM. Compiling Irregular Software to Specialized Hardware. [Internet] [Doctoral dissertation]. Columbia University; 2019. [cited 2020 Dec 03]. Available from: https://doi.org/10.7916/d8-4yxc-gz97.

Council of Science Editors:

Townsend RM. Compiling Irregular Software to Specialized Hardware. [Doctoral Dissertation]. Columbia University; 2019. Available from: https://doi.org/10.7916/d8-4yxc-gz97


University of Cambridge

18. Stark, Ian David Bede. Names and higher-order functions.

Degree: PhD, 1994, University of Cambridge

 Many functional programming languages rely on the elimination of 'impure' features: assignment to variables, exceptions and even input/output. But some of these are genuinely useful,… (more)

Subjects/Keywords: 005; Functional programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stark, I. D. B. (1994). Names and higher-order functions. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.15863 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361689

Chicago Manual of Style (16th Edition):

Stark, Ian David Bede. “Names and higher-order functions.” 1994. Doctoral Dissertation, University of Cambridge. Accessed December 03, 2020. https://doi.org/10.17863/CAM.15863 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361689.

MLA Handbook (7th Edition):

Stark, Ian David Bede. “Names and higher-order functions.” 1994. Web. 03 Dec 2020.

Vancouver:

Stark IDB. Names and higher-order functions. [Internet] [Doctoral dissertation]. University of Cambridge; 1994. [cited 2020 Dec 03]. Available from: https://doi.org/10.17863/CAM.15863 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361689.

Council of Science Editors:

Stark IDB. Names and higher-order functions. [Doctoral Dissertation]. University of Cambridge; 1994. Available from: https://doi.org/10.17863/CAM.15863 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361689


Universiteit Utrecht

19. Sijsling, Y. Generic programming with ornaments and dependent types.

Degree: 2016, Universiteit Utrecht

 Modern dependently typed functional programming languages like Agda allow very specific restrictions to be built into datatypes by using indices and dependent types. Properly restricted… (more)

Subjects/Keywords: Functional Programming; Generic Programming; Agda; Ornaments; Reflection; Dependent Types

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sijsling, Y. (2016). Generic programming with ornaments and dependent types. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/337070

Chicago Manual of Style (16th Edition):

Sijsling, Y. “Generic programming with ornaments and dependent types.” 2016. Masters Thesis, Universiteit Utrecht. Accessed December 03, 2020. http://dspace.library.uu.nl:8080/handle/1874/337070.

MLA Handbook (7th Edition):

Sijsling, Y. “Generic programming with ornaments and dependent types.” 2016. Web. 03 Dec 2020.

Vancouver:

Sijsling Y. Generic programming with ornaments and dependent types. [Internet] [Masters thesis]. Universiteit Utrecht; 2016. [cited 2020 Dec 03]. Available from: http://dspace.library.uu.nl:8080/handle/1874/337070.

Council of Science Editors:

Sijsling Y. Generic programming with ornaments and dependent types. [Masters Thesis]. Universiteit Utrecht; 2016. Available from: http://dspace.library.uu.nl:8080/handle/1874/337070


University of Victoria

20. Rondogiannis, Panagiotis. Higher-order functional languages and intensional logic.

Degree: Department of Computer Science, 2015, University of Victoria

Subjects/Keywords: functional programming; logic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rondogiannis, P. (2015). Higher-order functional languages and intensional logic. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5960

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rondogiannis, Panagiotis. “Higher-order functional languages and intensional logic.” 2015. Thesis, University of Victoria. Accessed December 03, 2020. http://hdl.handle.net/1828/5960.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rondogiannis, Panagiotis. “Higher-order functional languages and intensional logic.” 2015. Web. 03 Dec 2020.

Vancouver:

Rondogiannis P. Higher-order functional languages and intensional logic. [Internet] [Thesis]. University of Victoria; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1828/5960.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rondogiannis P. Higher-order functional languages and intensional logic. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/5960

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Melbourne

21. POPE, BERNARD JAMES. A declarative debugger for Haskell.

Degree: 2006, University of Melbourne

 This thesis considers the design and implementation of a Declarative Debugger for Haskell. At its core is a tree which captures the logical dependencies between… (more)

Subjects/Keywords: debugging; functional programming; programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

POPE, B. J. (2006). A declarative debugger for Haskell. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/39240

Chicago Manual of Style (16th Edition):

POPE, BERNARD JAMES. “A declarative debugger for Haskell.” 2006. Doctoral Dissertation, University of Melbourne. Accessed December 03, 2020. http://hdl.handle.net/11343/39240.

MLA Handbook (7th Edition):

POPE, BERNARD JAMES. “A declarative debugger for Haskell.” 2006. Web. 03 Dec 2020.

Vancouver:

POPE BJ. A declarative debugger for Haskell. [Internet] [Doctoral dissertation]. University of Melbourne; 2006. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11343/39240.

Council of Science Editors:

POPE BJ. A declarative debugger for Haskell. [Doctoral Dissertation]. University of Melbourne; 2006. Available from: http://hdl.handle.net/11343/39240


University of Missouri – Columbia

22. Graves, Ian. Device-level composition in ReWire.

Degree: 2015, University of Missouri – Columbia

 [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT REQUEST OF AUTHOR.] ReWire provides engineers with a tool to specify, verify and implement hardware devices for… (more)

Subjects/Keywords: functional programming; hardware design; HDL; programming languages; Haskell; compiler

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Graves, I. (2015). Device-level composition in ReWire. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/49535

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Graves, Ian. “Device-level composition in ReWire.” 2015. Thesis, University of Missouri – Columbia. Accessed December 03, 2020. http://hdl.handle.net/10355/49535.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Graves, Ian. “Device-level composition in ReWire.” 2015. Web. 03 Dec 2020.

Vancouver:

Graves I. Device-level composition in ReWire. [Internet] [Thesis]. University of Missouri – Columbia; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10355/49535.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Graves I. Device-level composition in ReWire. [Thesis]. University of Missouri – Columbia; 2015. Available from: http://hdl.handle.net/10355/49535

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Missouri – Columbia

23. Butler, Michael (Michael Christian). Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.

Degree: 2016, University of Missouri – Columbia

 [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT REQUEST OF AUTHOR.] As computers began to reach their limit on how fast a single processor could… (more)

Subjects/Keywords: Graphics processing units; Functional programming (Computer science); Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Butler, M. (. C. (2016). Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. (Thesis). University of Missouri – Columbia. Retrieved from https://doi.org/10.32469/10355/57620

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Butler, Michael (Michael Christian). “Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.” 2016. Thesis, University of Missouri – Columbia. Accessed December 03, 2020. https://doi.org/10.32469/10355/57620.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Butler, Michael (Michael Christian). “Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.” 2016. Web. 03 Dec 2020.

Vancouver:

Butler M(C. Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. [Internet] [Thesis]. University of Missouri – Columbia; 2016. [cited 2020 Dec 03]. Available from: https://doi.org/10.32469/10355/57620.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Butler M(C. Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. [Thesis]. University of Missouri – Columbia; 2016. Available from: https://doi.org/10.32469/10355/57620

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Victoria University of Wellington

24. Mackay, Julian. Decidable Subtyping for Path Dependent Types.

Degree: 2020, Victoria University of Wellington

 Path dependent types form a central component of the Scala programming language. Coupled with other expressive type forms, path dependent types provide for a diverse… (more)

Subjects/Keywords: Programming Languages; Formal Logics; Semantics; Functional Programming Languages; Object oriented Programming Languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mackay, J. (2020). Decidable Subtyping for Path Dependent Types. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/9081

Chicago Manual of Style (16th Edition):

Mackay, Julian. “Decidable Subtyping for Path Dependent Types.” 2020. Doctoral Dissertation, Victoria University of Wellington. Accessed December 03, 2020. http://hdl.handle.net/10063/9081.

MLA Handbook (7th Edition):

Mackay, Julian. “Decidable Subtyping for Path Dependent Types.” 2020. Web. 03 Dec 2020.

Vancouver:

Mackay J. Decidable Subtyping for Path Dependent Types. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2020. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10063/9081.

Council of Science Editors:

Mackay J. Decidable Subtyping for Path Dependent Types. [Doctoral Dissertation]. Victoria University of Wellington; 2020. Available from: http://hdl.handle.net/10063/9081


Portland State University

25. Peters, Arthur. The Basic Scheme for the Evaluation of Functional Logic Programs.

Degree: MS(M.S.) in Computer Science, Computer Science, 2012, Portland State University

Functional logic languages provide a powerful programming paradigm combining the features of functional languages and logic languages. However, current implementations of functional logic languages… (more)

Subjects/Keywords: Graph rewriting; Functional programming languages; Functional programming (Computer science); Logic programming; Rewriting systems (Computer science); Programming language implementation; Programming Languages and Compilers; Systems Architecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Peters, A. (2012). The Basic Scheme for the Evaluation of Functional Logic Programs. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/914

Chicago Manual of Style (16th Edition):

Peters, Arthur. “The Basic Scheme for the Evaluation of Functional Logic Programs.” 2012. Masters Thesis, Portland State University. Accessed December 03, 2020. https://pdxscholar.library.pdx.edu/open_access_etds/914.

MLA Handbook (7th Edition):

Peters, Arthur. “The Basic Scheme for the Evaluation of Functional Logic Programs.” 2012. Web. 03 Dec 2020.

Vancouver:

Peters A. The Basic Scheme for the Evaluation of Functional Logic Programs. [Internet] [Masters thesis]. Portland State University; 2012. [cited 2020 Dec 03]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/914.

Council of Science Editors:

Peters A. The Basic Scheme for the Evaluation of Functional Logic Programs. [Masters Thesis]. Portland State University; 2012. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/914


University of Alberta

26. Ng, Kris. Functional logic programming.

Degree: MS, Department of Computing Science, 1990, University of Alberta

Subjects/Keywords: Functional programming (Computer science); Logic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ng, K. (1990). Functional logic programming. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cf95jd535

Chicago Manual of Style (16th Edition):

Ng, Kris. “Functional logic programming.” 1990. Masters Thesis, University of Alberta. Accessed December 03, 2020. https://era.library.ualberta.ca/files/cf95jd535.

MLA Handbook (7th Edition):

Ng, Kris. “Functional logic programming.” 1990. Web. 03 Dec 2020.

Vancouver:

Ng K. Functional logic programming. [Internet] [Masters thesis]. University of Alberta; 1990. [cited 2020 Dec 03]. Available from: https://era.library.ualberta.ca/files/cf95jd535.

Council of Science Editors:

Ng K. Functional logic programming. [Masters Thesis]. University of Alberta; 1990. Available from: https://era.library.ualberta.ca/files/cf95jd535

27. Rodriguez, E. Generic Programming in F#.

Degree: 2015, Universiteit Utrecht

 Datatype generic programming is a programming model that exploits the structural similarities of different types in order to generically define functions on families of types.… (more)

Subjects/Keywords: generic programming; functional programming; polymorphism

…3 The F# language The F# [11] programming language is a functional language… …purely functional structures (value types) and the Object Oriented/Imperative… …NET terminology). ADTs in F# are very similar to those of a traditional functional… …polymorphism is implemented in the same way as in other functional languages. For ad-hoc polymorphism… …constraints given to the argument. A major difference between F# and other functional laungauges is… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rodriguez, E. (2015). Generic Programming in F#. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/320196

Chicago Manual of Style (16th Edition):

Rodriguez, E. “Generic Programming in F#.” 2015. Masters Thesis, Universiteit Utrecht. Accessed December 03, 2020. http://dspace.library.uu.nl:8080/handle/1874/320196.

MLA Handbook (7th Edition):

Rodriguez, E. “Generic Programming in F#.” 2015. Web. 03 Dec 2020.

Vancouver:

Rodriguez E. Generic Programming in F#. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Dec 03]. Available from: http://dspace.library.uu.nl:8080/handle/1874/320196.

Council of Science Editors:

Rodriguez E. Generic Programming in F#. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/320196


University of Arizona

28. Lin, Nai-Wei. Automatic complexity analysis of logic programs.

Degree: 1993, University of Arizona

 This dissertation describes research toward automatic complexity analysis of logic programs and its applications. Automatic complexity analysis of programs concerns the inference of the amount… (more)

Subjects/Keywords: Logic programming.; Functional programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lin, N. (1993). Automatic complexity analysis of logic programs. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/186287

Chicago Manual of Style (16th Edition):

Lin, Nai-Wei. “Automatic complexity analysis of logic programs. ” 1993. Doctoral Dissertation, University of Arizona. Accessed December 03, 2020. http://hdl.handle.net/10150/186287.

MLA Handbook (7th Edition):

Lin, Nai-Wei. “Automatic complexity analysis of logic programs. ” 1993. Web. 03 Dec 2020.

Vancouver:

Lin N. Automatic complexity analysis of logic programs. [Internet] [Doctoral dissertation]. University of Arizona; 1993. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10150/186287.

Council of Science Editors:

Lin N. Automatic complexity analysis of logic programs. [Doctoral Dissertation]. University of Arizona; 1993. Available from: http://hdl.handle.net/10150/186287


University of New South Wales

29. Stewart, Don. Dynamic extension of typed functional languages.

Degree: Computer Science & Engineering, 2010, University of New South Wales

 We present a solution to the problem of dynamic extension in staticallytyped functional languages with type erasure. The presented solutionretains the benefits of static checking,… (more)

Subjects/Keywords: Functional programming; Programming languages; Type systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stewart, D. (2010). Dynamic extension of typed functional languages. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/50220 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9098/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Stewart, Don. “Dynamic extension of typed functional languages.” 2010. Doctoral Dissertation, University of New South Wales. Accessed December 03, 2020. http://handle.unsw.edu.au/1959.4/50220 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9098/SOURCE02?view=true.

MLA Handbook (7th Edition):

Stewart, Don. “Dynamic extension of typed functional languages.” 2010. Web. 03 Dec 2020.

Vancouver:

Stewart D. Dynamic extension of typed functional languages. [Internet] [Doctoral dissertation]. University of New South Wales; 2010. [cited 2020 Dec 03]. Available from: http://handle.unsw.edu.au/1959.4/50220 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9098/SOURCE02?view=true.

Council of Science Editors:

Stewart D. Dynamic extension of typed functional languages. [Doctoral Dissertation]. University of New South Wales; 2010. Available from: http://handle.unsw.edu.au/1959.4/50220 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9098/SOURCE02?view=true


Portland State University

30. Bailey, Justin George. Using Dataflow Optimization Techniques with a Monadic Intermediate Language.

Degree: MS(M.S.) in Computer Science, Computer Science, 2012, Portland State University

  Our work applies the dataflow algorithm to an area outside its traditional scope: functional languages. Our approach relies on a monadic intermediate language that… (more)

Subjects/Keywords: Haskell; Monad; Hoopl; Data flow computing; Functional programming languages; Program transformation (Computer programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bailey, J. G. (2012). Using Dataflow Optimization Techniques with a Monadic Intermediate Language. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/508

Chicago Manual of Style (16th Edition):

Bailey, Justin George. “Using Dataflow Optimization Techniques with a Monadic Intermediate Language.” 2012. Masters Thesis, Portland State University. Accessed December 03, 2020. https://pdxscholar.library.pdx.edu/open_access_etds/508.

MLA Handbook (7th Edition):

Bailey, Justin George. “Using Dataflow Optimization Techniques with a Monadic Intermediate Language.” 2012. Web. 03 Dec 2020.

Vancouver:

Bailey JG. Using Dataflow Optimization Techniques with a Monadic Intermediate Language. [Internet] [Masters thesis]. Portland State University; 2012. [cited 2020 Dec 03]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/508.

Council of Science Editors:

Bailey JG. Using Dataflow Optimization Techniques with a Monadic Intermediate Language. [Masters Thesis]. Portland State University; 2012. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/508

[1] [2] [3] [4] [5] [6] [7]

.