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:(programming languages). Showing records 61 – 90 of 918 total matches.

[1] [2] [3] [4] [5] … [31]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of New Mexico

61. Reedy, Geoffrey. Design and Implementation of a Scala Compiler Backend Targeting the Low Level Virtual Machine.

Degree: Department of Computer Science, 2014, University of New Mexico

 The Scala programming language successfully blends object-oriented and functional programming. The current implementation of Scala is tied to the Java Virtual Machine (JVM) which constrains… (more)

Subjects/Keywords: programming languages; compilers; programming language implementation; llvm; scala

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reedy, G. (2014). Design and Implementation of a Scala Compiler Backend Targeting the Low Level Virtual Machine. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/24275

Chicago Manual of Style (16th Edition):

Reedy, Geoffrey. “Design and Implementation of a Scala Compiler Backend Targeting the Low Level Virtual Machine.” 2014. Masters Thesis, University of New Mexico. Accessed December 16, 2019. http://hdl.handle.net/1928/24275.

MLA Handbook (7th Edition):

Reedy, Geoffrey. “Design and Implementation of a Scala Compiler Backend Targeting the Low Level Virtual Machine.” 2014. Web. 16 Dec 2019.

Vancouver:

Reedy G. Design and Implementation of a Scala Compiler Backend Targeting the Low Level Virtual Machine. [Internet] [Masters thesis]. University of New Mexico; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/1928/24275.

Council of Science Editors:

Reedy G. Design and Implementation of a Scala Compiler Backend Targeting the Low Level Virtual Machine. [Masters Thesis]. University of New Mexico; 2014. Available from: http://hdl.handle.net/1928/24275


University of Missouri – Columbia

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

Degree: 2015, University of Missouri – Columbia

 [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] ReWire provides engineers with a tool to specify, verify and implement hardware devices for FPGAs… (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 16, 2019. 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. 16 Dec 2019.

Vancouver:

Graves I. Device-level composition in ReWire. [Internet] [Thesis]. University of Missouri – Columbia; 2015. [cited 2019 Dec 16]. 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


Northeastern University

63. Strickland, Tharpe Stephen. Scaling contracts to realistic languages.

Degree: PhD, Department of Computer Science, 2012, Northeastern University

 Contracts allow programmers to specify the expected behavior and use of program components separately from the code of the components themselves. Since Bertrand Meyer introduced… (more)

Subjects/Keywords: contract systems; computer programming; Computer Sciences; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Strickland, T. S. (2012). Scaling contracts to realistic languages. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/d20002780

Chicago Manual of Style (16th Edition):

Strickland, Tharpe Stephen. “Scaling contracts to realistic languages.” 2012. Doctoral Dissertation, Northeastern University. Accessed December 16, 2019. http://hdl.handle.net/2047/d20002780.

MLA Handbook (7th Edition):

Strickland, Tharpe Stephen. “Scaling contracts to realistic languages.” 2012. Web. 16 Dec 2019.

Vancouver:

Strickland TS. Scaling contracts to realistic languages. [Internet] [Doctoral dissertation]. Northeastern University; 2012. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2047/d20002780.

Council of Science Editors:

Strickland TS. Scaling contracts to realistic languages. [Doctoral Dissertation]. Northeastern University; 2012. Available from: http://hdl.handle.net/2047/d20002780


University of St. Andrews

64. Akgün, Özgür. Extensible automated constraint modelling via refinement of abstract problem specifications .

Degree: 2014, University of St. Andrews

 Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisation) problems. Constraint solving a given problem proceeds in two phases: modelling and solving.… (more)

Subjects/Keywords: Artificial intelligence; Constraint programming; Constraint modelling; Programming languages; Automated modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Akgün, . (2014). Extensible automated constraint modelling via refinement of abstract problem specifications . (Thesis). University of St. Andrews. Retrieved from http://hdl.handle.net/10023/6547

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):

Akgün, Özgür. “Extensible automated constraint modelling via refinement of abstract problem specifications .” 2014. Thesis, University of St. Andrews. Accessed December 16, 2019. http://hdl.handle.net/10023/6547.

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

MLA Handbook (7th Edition):

Akgün, Özgür. “Extensible automated constraint modelling via refinement of abstract problem specifications .” 2014. Web. 16 Dec 2019.

Vancouver:

Akgün . Extensible automated constraint modelling via refinement of abstract problem specifications . [Internet] [Thesis]. University of St. Andrews; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10023/6547.

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

Council of Science Editors:

Akgün . Extensible automated constraint modelling via refinement of abstract problem specifications . [Thesis]. University of St. Andrews; 2014. Available from: http://hdl.handle.net/10023/6547

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


University of Texas – Austin

65. -5275-5590. Elixir: synthesis of parallel irregular algorithms.

Degree: PhD, Computer Science, 2015, University of Texas – Austin

 Algorithms in new application areas like machine learning and data analytics usually operate on unstructured sparse graphs. Writing efficient parallel code to implement these algorithms… (more)

Subjects/Keywords: Parallel programming; Programming languages; Compilers; Static analysis; Synthesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-5275-5590. (2015). Elixir: synthesis of parallel irregular algorithms. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/33278

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-5275-5590. “Elixir: synthesis of parallel irregular algorithms.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed December 16, 2019. http://hdl.handle.net/2152/33278.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-5275-5590. “Elixir: synthesis of parallel irregular algorithms.” 2015. Web. 16 Dec 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-5275-5590. Elixir: synthesis of parallel irregular algorithms. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2152/33278.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-5275-5590. Elixir: synthesis of parallel irregular algorithms. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/33278

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Melbourne

66. GIUCA, MATTHEW. Mars: an imperative/declarative higher-order programming language with automatic destructive update.

Degree: 2014, University of Melbourne

 For years, we have enjoyed the robustness of programming without side-effects in languages such as Haskell and Mercury. Yet in order to use languages with… (more)

Subjects/Keywords: programming languages; imperative programming; declarative programming; destructive update; compile-time garbage collection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

GIUCA, M. (2014). Mars: an imperative/declarative higher-order programming language with automatic destructive update. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/43263

Chicago Manual of Style (16th Edition):

GIUCA, MATTHEW. “Mars: an imperative/declarative higher-order programming language with automatic destructive update.” 2014. Doctoral Dissertation, University of Melbourne. Accessed December 16, 2019. http://hdl.handle.net/11343/43263.

MLA Handbook (7th Edition):

GIUCA, MATTHEW. “Mars: an imperative/declarative higher-order programming language with automatic destructive update.” 2014. Web. 16 Dec 2019.

Vancouver:

GIUCA M. Mars: an imperative/declarative higher-order programming language with automatic destructive update. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/11343/43263.

Council of Science Editors:

GIUCA M. Mars: an imperative/declarative higher-order programming language with automatic destructive update. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/43263


University of Wisconsin – Milwaukee

67. Moctezuma, Antonio Pedro. The Effectiveness of Codesters in Teaching Basic Computer Science Topics.

Degree: MS, Computer Science, 2019, University of Wisconsin – Milwaukee

  Founded in 2014, Codesters is a visual programming environment (VPE) like the popular Scratch and Alice. Its goal is to teach middle school and… (more)

Subjects/Keywords: Block Programming; Codesters; K-12 Education; Visual Programming Environments; Visual Programming Languages; Education; Other Education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moctezuma, A. P. (2019). The Effectiveness of Codesters in Teaching Basic Computer Science Topics. (Thesis). University of Wisconsin – Milwaukee. Retrieved from https://dc.uwm.edu/etd/2103

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):

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Thesis, University of Wisconsin – Milwaukee. Accessed December 16, 2019. https://dc.uwm.edu/etd/2103.

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

MLA Handbook (7th Edition):

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Web. 16 Dec 2019.

Vancouver:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Internet] [Thesis]. University of Wisconsin – Milwaukee; 2019. [cited 2019 Dec 16]. Available from: https://dc.uwm.edu/etd/2103.

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

Council of Science Editors:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Thesis]. University of Wisconsin – Milwaukee; 2019. Available from: https://dc.uwm.edu/etd/2103

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

68. Jokela, Tiina. Tilausjärjestelmän käyttöliittymän toteutussuunnitelma : case: Oval Design Oy .

Degree: 2007, Theseus

Subjects/Keywords: tilausjärjestelmät; programming; web programming; programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jokela, T. (2007). Tilausjärjestelmän käyttöliittymän toteutussuunnitelma : case: Oval Design Oy . (Thesis). Theseus. Retrieved from http://www.theseus.fi/handle/10024/10172

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):

Jokela, Tiina. “Tilausjärjestelmän käyttöliittymän toteutussuunnitelma : case: Oval Design Oy .” 2007. Thesis, Theseus. Accessed December 16, 2019. http://www.theseus.fi/handle/10024/10172.

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

MLA Handbook (7th Edition):

Jokela, Tiina. “Tilausjärjestelmän käyttöliittymän toteutussuunnitelma : case: Oval Design Oy .” 2007. Web. 16 Dec 2019.

Vancouver:

Jokela T. Tilausjärjestelmän käyttöliittymän toteutussuunnitelma : case: Oval Design Oy . [Internet] [Thesis]. Theseus; 2007. [cited 2019 Dec 16]. Available from: http://www.theseus.fi/handle/10024/10172.

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

Council of Science Editors:

Jokela T. Tilausjärjestelmän käyttöliittymän toteutussuunnitelma : case: Oval Design Oy . [Thesis]. Theseus; 2007. Available from: http://www.theseus.fi/handle/10024/10172

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


University of Wisconsin – Milwaukee

69. Moctezuma, Antonio Pedro. The Effectiveness of Codesters in Teaching Basic Computer Science Topics.

Degree: MS, Computer Science, 2019, University of Wisconsin – Milwaukee

  Founded in 2014, Codesters is a visual programming environment (VPE) like the popular Scratch and Alice. Its goal is to teach middle school and… (more)

Subjects/Keywords: Block Programming; Codesters; K-12 Education; Visual Programming Environments; Visual Programming Languages; Education; Other Education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moctezuma, A. P. (2019). The Effectiveness of Codesters in Teaching Basic Computer Science Topics. (Thesis). University of Wisconsin – Milwaukee. Retrieved from https://dc.uwm.edu/etd/2227

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):

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Thesis, University of Wisconsin – Milwaukee. Accessed December 16, 2019. https://dc.uwm.edu/etd/2227.

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

MLA Handbook (7th Edition):

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Web. 16 Dec 2019.

Vancouver:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Internet] [Thesis]. University of Wisconsin – Milwaukee; 2019. [cited 2019 Dec 16]. Available from: https://dc.uwm.edu/etd/2227.

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

Council of Science Editors:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Thesis]. University of Wisconsin – Milwaukee; 2019. Available from: https://dc.uwm.edu/etd/2227

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

70. E. Vacchi. PROGRAMMING LANGUAGES À LA CARTE.

Degree: 2015, Università degli Studi di Milano

 Code reuse in computer language development is an open research problem. Feature-oriented programming is a vision of computer programming in which features can be implemented… (more)

Subjects/Keywords: programming languages; dsl; domain-specific languages; feature-oriented programming; programming; compilers; interpreters; language development; Settore INF/01 - Informatica

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vacchi, E. (2015). PROGRAMMING LANGUAGES À LA CARTE. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/263620

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):

Vacchi, E.. “PROGRAMMING LANGUAGES À LA CARTE.” 2015. Thesis, Università degli Studi di Milano. Accessed December 16, 2019. http://hdl.handle.net/2434/263620.

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

MLA Handbook (7th Edition):

Vacchi, E.. “PROGRAMMING LANGUAGES À LA CARTE.” 2015. Web. 16 Dec 2019.

Vancouver:

Vacchi E. PROGRAMMING LANGUAGES À LA CARTE. [Internet] [Thesis]. Università degli Studi di Milano; 2015. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2434/263620.

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

Council of Science Editors:

Vacchi E. PROGRAMMING LANGUAGES À LA CARTE. [Thesis]. Università degli Studi di Milano; 2015. Available from: http://hdl.handle.net/2434/263620

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


Northeastern University

71. Stansifer, Paul. Flexible binding-safe programming.

Degree: PhD, Computer Science Program, 2016, Northeastern University

 Current nominal systems for safely manipulating values with names, like Pure FreshML, only support simple binding structures for those names. As a result, few tools… (more)

Subjects/Keywords: binding; macros; metaprogramming; Programming languages (Electronic computers); Semantics; Programming languages (Electronic computers); Syntax; Computer programming; Redex (Computer program language)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stansifer, P. (2016). Flexible binding-safe programming. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20213100

Chicago Manual of Style (16th Edition):

Stansifer, Paul. “Flexible binding-safe programming.” 2016. Doctoral Dissertation, Northeastern University. Accessed December 16, 2019. http://hdl.handle.net/2047/D20213100.

MLA Handbook (7th Edition):

Stansifer, Paul. “Flexible binding-safe programming.” 2016. Web. 16 Dec 2019.

Vancouver:

Stansifer P. Flexible binding-safe programming. [Internet] [Doctoral dissertation]. Northeastern University; 2016. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2047/D20213100.

Council of Science Editors:

Stansifer P. Flexible binding-safe programming. [Doctoral Dissertation]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20213100


Portland State University

72. 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 16, 2019. 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. 16 Dec 2019.

Vancouver:

Peters A. The Basic Scheme for the Evaluation of Functional Logic Programs. [Internet] [Masters thesis]. Portland State University; 2012. [cited 2019 Dec 16]. 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


Rhodes University

73. Wright, David A. An integration of reduction and logic for programming languages.

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

 A new declarative language is presented which captures the expressibility of both logic programming languages and functional languages. This is achieved by conditional graph rewriting,… (more)

Subjects/Keywords: Logic programming languages; Programming languages (Electronic computers); Logic programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wright, D. A. (1988). An integration of reduction and logic for programming languages. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1002035

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):

Wright, David A. “An integration of reduction and logic for programming languages.” 1988. Thesis, Rhodes University. Accessed December 16, 2019. http://hdl.handle.net/10962/d1002035.

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

MLA Handbook (7th Edition):

Wright, David A. “An integration of reduction and logic for programming languages.” 1988. Web. 16 Dec 2019.

Vancouver:

Wright DA. An integration of reduction and logic for programming languages. [Internet] [Thesis]. Rhodes University; 1988. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/10962/d1002035.

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

Council of Science Editors:

Wright DA. An integration of reduction and logic for programming languages. [Thesis]. Rhodes University; 1988. Available from: http://hdl.handle.net/10962/d1002035

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


Northeastern University

74. Fisher, David. Static semantics for syntax objects.

Degree: PhD, Department of Computer Science, 2010, Northeastern University

 Designing custom notations is essential to designing advanced systems. Although an electrical engineer could write an English description of a circuit board, explaining which components… (more)

Subjects/Keywords: computer science; language design; language theory; macros; metaprogramming; semantics; syntax; Programming languages (Electronic computers) - Semantics; Programming languages (Electronic computers) - Syntax; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fisher, D. (2010). Static semantics for syntax objects. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/d20000910

Chicago Manual of Style (16th Edition):

Fisher, David. “Static semantics for syntax objects.” 2010. Doctoral Dissertation, Northeastern University. Accessed December 16, 2019. http://hdl.handle.net/2047/d20000910.

MLA Handbook (7th Edition):

Fisher, David. “Static semantics for syntax objects.” 2010. Web. 16 Dec 2019.

Vancouver:

Fisher D. Static semantics for syntax objects. [Internet] [Doctoral dissertation]. Northeastern University; 2010. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2047/d20000910.

Council of Science Editors:

Fisher D. Static semantics for syntax objects. [Doctoral Dissertation]. Northeastern University; 2010. Available from: http://hdl.handle.net/2047/d20000910


University of Tasmania

75. Lewis, IJ. Genesis: An Extensible Java.

Degree: 2005, University of Tasmania

 Extensible programming languages allow users to create fundamentally new syntax and translate this syntax into language primitives. The concept of compile-time meta-programming has been around… (more)

Subjects/Keywords: 280303 Programming Languages; 280301 Programming Techniques; Programming Languages; Extensibility; Java; Meta-programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lewis, I. (2005). Genesis: An Extensible Java. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/637/1/01Front.pdf ; https://eprints.utas.edu.au/637/2/02Whole.pdf

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):

Lewis, IJ. “Genesis: An Extensible Java.” 2005. Thesis, University of Tasmania. Accessed December 16, 2019. https://eprints.utas.edu.au/637/1/01Front.pdf ; https://eprints.utas.edu.au/637/2/02Whole.pdf.

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

MLA Handbook (7th Edition):

Lewis, IJ. “Genesis: An Extensible Java.” 2005. Web. 16 Dec 2019.

Vancouver:

Lewis I. Genesis: An Extensible Java. [Internet] [Thesis]. University of Tasmania; 2005. [cited 2019 Dec 16]. Available from: https://eprints.utas.edu.au/637/1/01Front.pdf ; https://eprints.utas.edu.au/637/2/02Whole.pdf.

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

Council of Science Editors:

Lewis I. Genesis: An Extensible Java. [Thesis]. University of Tasmania; 2005. Available from: https://eprints.utas.edu.au/637/1/01Front.pdf ; https://eprints.utas.edu.au/637/2/02Whole.pdf

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


Portland State University

76. Huffman, Brian Charles. HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs.

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

  HOLCF is an interactive theorem proving system that uses the mathematics of domain theory to reason about programs written in functional programming languages. This… (more)

Subjects/Keywords: Denotational semantics; Theorem proving; Domain theory; Computer programs  – Verification; Programming languages (Electronic computers)  – Semantics; Functional programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huffman, B. C. (2011). HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/113

Chicago Manual of Style (16th Edition):

Huffman, Brian Charles. “HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs.” 2011. Doctoral Dissertation, Portland State University. Accessed December 16, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/113.

MLA Handbook (7th Edition):

Huffman, Brian Charles. “HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs.” 2011. Web. 16 Dec 2019.

Vancouver:

Huffman BC. HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs. [Internet] [Doctoral dissertation]. Portland State University; 2011. [cited 2019 Dec 16]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/113.

Council of Science Editors:

Huffman BC. HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs. [Doctoral Dissertation]. Portland State University; 2011. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/113


Pontifical Catholic University of Rio de Janeiro

77. MARCELO OIKAWA. [en] CONVERTING REGEXES TO PEGS.

Degree: 2011, Pontifical Catholic University of Rio de Janeiro

[pt] Expressões regulares são um formalismo utilizado para descrever linguagens regulares e compõem a base de diversas bibliotecas de casamento de padrão. No entanto, existem… (more)

Subjects/Keywords: [pt] LINGUAGEM LUA; [en] LUA PROGRAMMING LANGUAGE; [pt] LINGUAGENS DE SCRIPT; [en] SCRIPTING LANGUAGES; [pt] LINGUAGENS DE PROGRAMACAO; [en] PROGRAMMING LANGUAGES

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

OIKAWA, M. (2011). [en] CONVERTING REGEXES TO PEGS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16815

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):

OIKAWA, MARCELO. “[en] CONVERTING REGEXES TO PEGS.” 2011. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed December 16, 2019. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16815.

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

MLA Handbook (7th Edition):

OIKAWA, MARCELO. “[en] CONVERTING REGEXES TO PEGS.” 2011. Web. 16 Dec 2019.

Vancouver:

OIKAWA M. [en] CONVERTING REGEXES TO PEGS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2011. [cited 2019 Dec 16]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16815.

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

Council of Science Editors:

OIKAWA M. [en] CONVERTING REGEXES TO PEGS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2011. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16815

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


McMaster University

78. Fedorenko, Vitalii M. Validation DSL for client-server applications.

Degree: MSc, 2012, McMaster University

Given the nature of client-server applications, most use some freeform interface, like web forms, to collect user input. The main difficulty with this approach… (more)

Subjects/Keywords: domain-specific language; input validation; input preprocessing; internal DSL; embedded DSL; groovy DSL; Programming Languages and Compilers; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fedorenko, V. M. (2012). Validation DSL for client-server applications. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/12326

Chicago Manual of Style (16th Edition):

Fedorenko, Vitalii M. “Validation DSL for client-server applications.” 2012. Masters Thesis, McMaster University. Accessed December 16, 2019. http://hdl.handle.net/11375/12326.

MLA Handbook (7th Edition):

Fedorenko, Vitalii M. “Validation DSL for client-server applications.” 2012. Web. 16 Dec 2019.

Vancouver:

Fedorenko VM. Validation DSL for client-server applications. [Internet] [Masters thesis]. McMaster University; 2012. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/11375/12326.

Council of Science Editors:

Fedorenko VM. Validation DSL for client-server applications. [Masters Thesis]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12326


University of Florida

79. Sanders, Kenneth. RtyPAL: Static typing in RPAL.

Degree: 2010, University of Florida

 RPAL, or the Right-reference Pedagogical Algorithmic Language, is a tiny functional programming language designed for teaching. The language definition, often referred to as the Itty… (more)

Subjects/Keywords: ALGOL; Algorithms; Computer science education; Function values; Instructional design; Mathematical independent variables; Programming languages; Programming languages (Electronic computers); Teaching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sanders, K. (2010). RtyPAL: Static typing in RPAL. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00059545

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):

Sanders, Kenneth. “RtyPAL: Static typing in RPAL.” 2010. Thesis, University of Florida. Accessed December 16, 2019. http://ufdc.ufl.edu/AA00059545.

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

MLA Handbook (7th Edition):

Sanders, Kenneth. “RtyPAL: Static typing in RPAL.” 2010. Web. 16 Dec 2019.

Vancouver:

Sanders K. RtyPAL: Static typing in RPAL. [Internet] [Thesis]. University of Florida; 2010. [cited 2019 Dec 16]. Available from: http://ufdc.ufl.edu/AA00059545.

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

Council of Science Editors:

Sanders K. RtyPAL: Static typing in RPAL. [Thesis]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/AA00059545

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


Northeastern University

80. Yaddav, Vishesh. RacketScript: a Racket to JavaScript compiler.

Degree: MS, Computer Science Program, 2016, Northeastern University

 We present RacketScript, a Racket-to-JavaScript compiler that incorporates features and data structures from both Racket and JavaScript, enabling RacketScript programs to interoperate with libraries from… (more)

Subjects/Keywords: JavaScript; programming languages; web; Compilers (Computer programs); Racket (Computer program language); JavaScript (Computer program language); Programming languages (Electronic computers); Semantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yaddav, V. (2016). RacketScript: a Racket to JavaScript compiler. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20235622

Chicago Manual of Style (16th Edition):

Yaddav, Vishesh. “RacketScript: a Racket to JavaScript compiler.” 2016. Masters Thesis, Northeastern University. Accessed December 16, 2019. http://hdl.handle.net/2047/D20235622.

MLA Handbook (7th Edition):

Yaddav, Vishesh. “RacketScript: a Racket to JavaScript compiler.” 2016. Web. 16 Dec 2019.

Vancouver:

Yaddav V. RacketScript: a Racket to JavaScript compiler. [Internet] [Masters thesis]. Northeastern University; 2016. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2047/D20235622.

Council of Science Editors:

Yaddav V. RacketScript: a Racket to JavaScript compiler. [Masters Thesis]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20235622


Michigan State University

81. Motteler, Zane C. A LL grammar analyzer.

Degree: MS, Department of Computer Science, 1981, Michigan State University

Subjects/Keywords: Programming languages (Electronic computers); Programming languages (Electronic computers) – Syntax

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Motteler, Z. C. (1981). A LL grammar analyzer. (Masters Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:45218

Chicago Manual of Style (16th Edition):

Motteler, Zane C. “A LL grammar analyzer.” 1981. Masters Thesis, Michigan State University. Accessed December 16, 2019. http://etd.lib.msu.edu/islandora/object/etd:45218.

MLA Handbook (7th Edition):

Motteler, Zane C. “A LL grammar analyzer.” 1981. Web. 16 Dec 2019.

Vancouver:

Motteler ZC. A LL grammar analyzer. [Internet] [Masters thesis]. Michigan State University; 1981. [cited 2019 Dec 16]. Available from: http://etd.lib.msu.edu/islandora/object/etd:45218.

Council of Science Editors:

Motteler ZC. A LL grammar analyzer. [Masters Thesis]. Michigan State University; 1981. Available from: http://etd.lib.msu.edu/islandora/object/etd:45218


University of Colorado

82. Prescott, Moss. Speaking for the Trees: a new (old) approach to languages and syntax.

Degree: MS, Computer Science, 2010, University of Colorado

  Programmers in many fields are interested in building new languages. In the same way that high-level languages increase productivity by allowing programmers to accomplish… (more)

Subjects/Keywords: extension; grammar; language; meta-programming; syntax; usability; Computer Sciences; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prescott, M. (2010). Speaking for the Trees: a new (old) approach to languages and syntax. (Masters Thesis). University of Colorado. Retrieved from http://scholar.colorado.edu/csci_gradetds/7

Chicago Manual of Style (16th Edition):

Prescott, Moss. “Speaking for the Trees: a new (old) approach to languages and syntax.” 2010. Masters Thesis, University of Colorado. Accessed December 16, 2019. http://scholar.colorado.edu/csci_gradetds/7.

MLA Handbook (7th Edition):

Prescott, Moss. “Speaking for the Trees: a new (old) approach to languages and syntax.” 2010. Web. 16 Dec 2019.

Vancouver:

Prescott M. Speaking for the Trees: a new (old) approach to languages and syntax. [Internet] [Masters thesis]. University of Colorado; 2010. [cited 2019 Dec 16]. Available from: http://scholar.colorado.edu/csci_gradetds/7.

Council of Science Editors:

Prescott M. Speaking for the Trees: a new (old) approach to languages and syntax. [Masters Thesis]. University of Colorado; 2010. Available from: http://scholar.colorado.edu/csci_gradetds/7


EPFL

83. Mayer, Mikaël. Interactive Programming by Example.

Degree: 2017, EPFL

 As of today, programming has never been so accessible. Yet, it remains a challenge for end-users: students, non-technical employees, experts in their domains outside of… (more)

Subjects/Keywords: Programming by example; programming by demonstration; program synthesis; accessibility; domain-specific languages; active learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mayer, M. (2017). Interactive Programming by Example. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/231153

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):

Mayer, Mikaël. “Interactive Programming by Example.” 2017. Thesis, EPFL. Accessed December 16, 2019. http://infoscience.epfl.ch/record/231153.

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

MLA Handbook (7th Edition):

Mayer, Mikaël. “Interactive Programming by Example.” 2017. Web. 16 Dec 2019.

Vancouver:

Mayer M. Interactive Programming by Example. [Internet] [Thesis]. EPFL; 2017. [cited 2019 Dec 16]. Available from: http://infoscience.epfl.ch/record/231153.

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

Council of Science Editors:

Mayer M. Interactive Programming by Example. [Thesis]. EPFL; 2017. Available from: http://infoscience.epfl.ch/record/231153

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


Vilnius Pedagogical University

84. Narkevičius, Darjušas. Logo programavimas mokykloje.

Degree: Master, Informatics, 2013, Vilnius Pedagogical University

Šis darbas yra apie Logo programavimą mokykloje. Darbe išanalizuota S. Paperto filosofija, kurią gerai apibūdina frazė „mokymasis kuriant“. Apžvelgtos Logo savybės bei skirtingi mokimo stiliai.… (more)

Subjects/Keywords: Logo; Programavimas mokykloje; Programavimo kalbų palyginimas; Logo; School programming; Programming languages ​​comparison

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Narkevičius, Darjušas. (2013). Logo programavimas mokykloje. (Masters Thesis). Vilnius Pedagogical University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130802_133534-93369 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Narkevičius, Darjušas. “Logo programavimas mokykloje.” 2013. Masters Thesis, Vilnius Pedagogical University. Accessed December 16, 2019. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130802_133534-93369 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Narkevičius, Darjušas. “Logo programavimas mokykloje.” 2013. Web. 16 Dec 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Narkevičius, Darjušas. Logo programavimas mokykloje. [Internet] [Masters thesis]. Vilnius Pedagogical University; 2013. [cited 2019 Dec 16]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130802_133534-93369 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Narkevičius, Darjušas. Logo programavimas mokykloje. [Masters Thesis]. Vilnius Pedagogical University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130802_133534-93369 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Portland State University

85. Graunke, Kenneth William. Extensible Scheduling in a Haskell-based Operating System.

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

  This thesis presents Lighthouse, an experimental branch of the Haskell-based House operating system which integrates Li et al.'s Lightweight Concurrency framework. First and foremost,… (more)

Subjects/Keywords: Programming languages (Electronic computers)  – Development; Systems programming (Computer science); Haskell (Computer program language)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graunke, K. W. (2010). Extensible Scheduling in a Haskell-based Operating System. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/1

Chicago Manual of Style (16th Edition):

Graunke, Kenneth William. “Extensible Scheduling in a Haskell-based Operating System.” 2010. Masters Thesis, Portland State University. Accessed December 16, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/1.

MLA Handbook (7th Edition):

Graunke, Kenneth William. “Extensible Scheduling in a Haskell-based Operating System.” 2010. Web. 16 Dec 2019.

Vancouver:

Graunke KW. Extensible Scheduling in a Haskell-based Operating System. [Internet] [Masters thesis]. Portland State University; 2010. [cited 2019 Dec 16]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/1.

Council of Science Editors:

Graunke KW. Extensible Scheduling in a Haskell-based Operating System. [Masters Thesis]. Portland State University; 2010. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/1


California State University – San Bernardino

86. Concepcion, Rowen. Introducing Non-Determinism to the Parallel C Compiler.

Degree: MSin Computer Science, School of Computer Science and Engineering, 2014, California State University – San Bernardino

  The Planguages project is the birthplace of the Planguage programming approach, which is designed to alleviate the task of writing parallel programs and harness… (more)

Subjects/Keywords: Non-Determinism; Parallel Programming; Parallel C; SOS; Shortcutting; Programming Languages and Compilers; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Concepcion, R. (2014). Introducing Non-Determinism to the Parallel C Compiler. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/22

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):

Concepcion, Rowen. “Introducing Non-Determinism to the Parallel C Compiler.” 2014. Thesis, California State University – San Bernardino. Accessed December 16, 2019. http://scholarworks.lib.csusb.edu/etd/22.

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

MLA Handbook (7th Edition):

Concepcion, Rowen. “Introducing Non-Determinism to the Parallel C Compiler.” 2014. Web. 16 Dec 2019.

Vancouver:

Concepcion R. Introducing Non-Determinism to the Parallel C Compiler. [Internet] [Thesis]. California State University – San Bernardino; 2014. [cited 2019 Dec 16]. Available from: http://scholarworks.lib.csusb.edu/etd/22.

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

Council of Science Editors:

Concepcion R. Introducing Non-Determinism to the Parallel C Compiler. [Thesis]. California State University – San Bernardino; 2014. Available from: http://scholarworks.lib.csusb.edu/etd/22

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

87. Kuznetcov, Maksim. Data-Driven Self-Tuning in a Coordination Programming Language .

Degree: 2016, University of Hertfordshire

 Coordination programming is a paradigm for managing composition, communication, and synchronisation of concurrent components. AstraKahn is a new dataflow coordination language based on Gilles Kahn???s… (more)

Subjects/Keywords: coordination programming; programming languages; astrakhan; s-net; self-tuning; runtime system; particle-in-cells

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kuznetcov, M. (2016). Data-Driven Self-Tuning in a Coordination Programming Language . (Thesis). University of Hertfordshire. Retrieved from http://hdl.handle.net/2299/17198

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):

Kuznetcov, Maksim. “Data-Driven Self-Tuning in a Coordination Programming Language .” 2016. Thesis, University of Hertfordshire. Accessed December 16, 2019. http://hdl.handle.net/2299/17198.

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

MLA Handbook (7th Edition):

Kuznetcov, Maksim. “Data-Driven Self-Tuning in a Coordination Programming Language .” 2016. Web. 16 Dec 2019.

Vancouver:

Kuznetcov M. Data-Driven Self-Tuning in a Coordination Programming Language . [Internet] [Thesis]. University of Hertfordshire; 2016. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/2299/17198.

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

Council of Science Editors:

Kuznetcov M. Data-Driven Self-Tuning in a Coordination Programming Language . [Thesis]. University of Hertfordshire; 2016. Available from: http://hdl.handle.net/2299/17198

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


Portland State University

88. 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 16, 2019. 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. 16 Dec 2019.

Vancouver:

Bailey JG. Using Dataflow Optimization Techniques with a Monadic Intermediate Language. [Internet] [Masters thesis]. Portland State University; 2012. [cited 2019 Dec 16]. 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


McMaster University

89. Alhazmi, Elaf. The Concept of Ownership in Rust and Swift.

Degree: MSc, 2018, McMaster University

There is a great number of programming languages and they follow various paradigms such as imperative, functional, or logic programming among the major ones and… (more)

Subjects/Keywords: Memory Management; Ownership; Programming Languages; Rust; Swift; C; C++; Java; Memory Safety; Cognitive Programming Skills

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alhazmi, E. (2018). The Concept of Ownership in Rust and Swift. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/23625

Chicago Manual of Style (16th Edition):

Alhazmi, Elaf. “The Concept of Ownership in Rust and Swift.” 2018. Masters Thesis, McMaster University. Accessed December 16, 2019. http://hdl.handle.net/11375/23625.

MLA Handbook (7th Edition):

Alhazmi, Elaf. “The Concept of Ownership in Rust and Swift.” 2018. Web. 16 Dec 2019.

Vancouver:

Alhazmi E. The Concept of Ownership in Rust and Swift. [Internet] [Masters thesis]. McMaster University; 2018. [cited 2019 Dec 16]. Available from: http://hdl.handle.net/11375/23625.

Council of Science Editors:

Alhazmi E. The Concept of Ownership in Rust and Swift. [Masters Thesis]. McMaster University; 2018. Available from: http://hdl.handle.net/11375/23625


University of Arkansas

90. Lai, Chenggang. Study of Parallel Programming Models on Computer Clusters with Accelerators.

Degree: MSCmpE, 2014, University of Arkansas

  In order to reach exascale computing capability, accelerators have become a crucial part in developing supercomputers. This work examines the potential of two latest… (more)

Subjects/Keywords: Accelerators; Hybrid Architecture; Parallel Programming; Computer and Systems Architecture; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lai, C. (2014). Study of Parallel Programming Models on Computer Clusters with Accelerators. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/2046

Chicago Manual of Style (16th Edition):

Lai, Chenggang. “Study of Parallel Programming Models on Computer Clusters with Accelerators.” 2014. Masters Thesis, University of Arkansas. Accessed December 16, 2019. https://scholarworks.uark.edu/etd/2046.

MLA Handbook (7th Edition):

Lai, Chenggang. “Study of Parallel Programming Models on Computer Clusters with Accelerators.” 2014. Web. 16 Dec 2019.

Vancouver:

Lai C. Study of Parallel Programming Models on Computer Clusters with Accelerators. [Internet] [Masters thesis]. University of Arkansas; 2014. [cited 2019 Dec 16]. Available from: https://scholarworks.uark.edu/etd/2046.

Council of Science Editors:

Lai C. Study of Parallel Programming Models on Computer Clusters with Accelerators. [Masters Thesis]. University of Arkansas; 2014. Available from: https://scholarworks.uark.edu/etd/2046

[1] [2] [3] [4] [5] … [31]

.