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 1 – 30 of 916 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Guha, Arjun. Semantics and Types for Safe Web Programming.

Degree: PhD, Computer Science, 2012, Brown University

 Web programs are distinct from traditional programs in two key ways. First, programs freely compose data and code from several sources. Second, the user often… (more)

Subjects/Keywords: programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guha, A. (2012). Semantics and Types for Safe Web Programming. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297608/

Chicago Manual of Style (16th Edition):

Guha, Arjun. “Semantics and Types for Safe Web Programming.” 2012. Doctoral Dissertation, Brown University. Accessed November 17, 2019. https://repository.library.brown.edu/studio/item/bdr:297608/.

MLA Handbook (7th Edition):

Guha, Arjun. “Semantics and Types for Safe Web Programming.” 2012. Web. 17 Nov 2019.

Vancouver:

Guha A. Semantics and Types for Safe Web Programming. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Nov 17]. Available from: https://repository.library.brown.edu/studio/item/bdr:297608/.

Council of Science Editors:

Guha A. Semantics and Types for Safe Web Programming. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297608/


Rochester Institute of Technology

2. 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 November 17, 2019. 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. 17 Nov 2019.

Vancouver:

Amsden E. Timeflies: Push-pull signal-function functional reactive programming. [Internet] [Thesis]. Rochester Institute of Technology; 2013. [cited 2019 Nov 17]. 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


Victoria University of Wellington

3. Dymnikov, Constantine. OwnKit: Ownership Inference for Java.

Degree: 2013, Victoria University of Wellington

 Object ownership allows us to statically control run-time aliasing in order to provide a strong notion of object encapsulation. Unfortunately in order to use ownership,… (more)

Subjects/Keywords: Encapsulation; Aliasing; Programming languages; Object-oriented programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dymnikov, C. (2013). OwnKit: Ownership Inference for Java. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/2742

Chicago Manual of Style (16th Edition):

Dymnikov, Constantine. “OwnKit: Ownership Inference for Java.” 2013. Masters Thesis, Victoria University of Wellington. Accessed November 17, 2019. http://hdl.handle.net/10063/2742.

MLA Handbook (7th Edition):

Dymnikov, Constantine. “OwnKit: Ownership Inference for Java.” 2013. Web. 17 Nov 2019.

Vancouver:

Dymnikov C. OwnKit: Ownership Inference for Java. [Internet] [Masters thesis]. Victoria University of Wellington; 2013. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10063/2742.

Council of Science Editors:

Dymnikov C. OwnKit: Ownership Inference for Java. [Masters Thesis]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/2742


University of Hong Kong

4. Zhang, Weixin. Extensible domain-specific languages in object-oriented programming.

Degree: M. Phil., 2017, University of Hong Kong

Domain-specific languages (DSLs) are now ubiquitous. New DSLs are needed and existing DSLs are evolving all the time. However, creating and maintaining DSLs is hard!… (more)

Subjects/Keywords: Domain-specific programming languages; Object-oriented programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, W. (2017). Extensible domain-specific languages in object-oriented programming. (Masters Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/241427

Chicago Manual of Style (16th Edition):

Zhang, Weixin. “Extensible domain-specific languages in object-oriented programming.” 2017. Masters Thesis, University of Hong Kong. Accessed November 17, 2019. http://hdl.handle.net/10722/241427.

MLA Handbook (7th Edition):

Zhang, Weixin. “Extensible domain-specific languages in object-oriented programming.” 2017. Web. 17 Nov 2019.

Vancouver:

Zhang W. Extensible domain-specific languages in object-oriented programming. [Internet] [Masters thesis]. University of Hong Kong; 2017. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10722/241427.

Council of Science Editors:

Zhang W. Extensible domain-specific languages in object-oriented programming. [Masters Thesis]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/241427


University of Oxford

5. 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 November 17, 2019. 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. 17 Nov 2019.

Vancouver:

Harper T. Theory and practice of shortcut fusion. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Nov 17]. 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


University of New South Wales

6. 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 November 17, 2019. 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. 17 Nov 2019.

Vancouver:

Stewart D. Dynamic extension of typed functional languages. [Internet] [Doctoral dissertation]. University of New South Wales; 2010. [cited 2019 Nov 17]. 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


University of Minnesota

7. Manjacheri, Lijesh Krishnan. Composable semantics using higher-order attribute grammars.

Degree: PhD, Computer science, 2012, University of Minnesota

 Ideally, programmers could make use of domain-specific knowledge and program using constructs that implement abstractions in their problem domains, and obtain domain-appropriate feedback. Further, new… (more)

Subjects/Keywords: Attribute grammars; Compilers; Extensible languages; Programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manjacheri, L. K. (2012). Composable semantics using higher-order attribute grammars. (Doctoral Dissertation). University of Minnesota. Retrieved from http://purl.umn.edu/144010

Chicago Manual of Style (16th Edition):

Manjacheri, Lijesh Krishnan. “Composable semantics using higher-order attribute grammars.” 2012. Doctoral Dissertation, University of Minnesota. Accessed November 17, 2019. http://purl.umn.edu/144010.

MLA Handbook (7th Edition):

Manjacheri, Lijesh Krishnan. “Composable semantics using higher-order attribute grammars.” 2012. Web. 17 Nov 2019.

Vancouver:

Manjacheri LK. Composable semantics using higher-order attribute grammars. [Internet] [Doctoral dissertation]. University of Minnesota; 2012. [cited 2019 Nov 17]. Available from: http://purl.umn.edu/144010.

Council of Science Editors:

Manjacheri LK. Composable semantics using higher-order attribute grammars. [Doctoral Dissertation]. University of Minnesota; 2012. Available from: http://purl.umn.edu/144010


University of Utah

8. Rafkind, Jon. Syntactic extension for languages with implicitly delimited and infix syntax.

Degree: PhD, Computing (School of), 2013, University of Utah

 I present the design of a parser that adds Scheme-style language extensibility to languages withimplicitly delimited and infix syntax. A key element of my design… (more)

Subjects/Keywords: extensible; macros; programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rafkind, J. (2013). Syntactic extension for languages with implicitly delimited and infix syntax. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2291/rec/2332

Chicago Manual of Style (16th Edition):

Rafkind, Jon. “Syntactic extension for languages with implicitly delimited and infix syntax.” 2013. Doctoral Dissertation, University of Utah. Accessed November 17, 2019. http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2291/rec/2332.

MLA Handbook (7th Edition):

Rafkind, Jon. “Syntactic extension for languages with implicitly delimited and infix syntax.” 2013. Web. 17 Nov 2019.

Vancouver:

Rafkind J. Syntactic extension for languages with implicitly delimited and infix syntax. [Internet] [Doctoral dissertation]. University of Utah; 2013. [cited 2019 Nov 17]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2291/rec/2332.

Council of Science Editors:

Rafkind J. Syntactic extension for languages with implicitly delimited and infix syntax. [Doctoral Dissertation]. University of Utah; 2013. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2291/rec/2332


University of Gothenburg / Göteborgs Universitet

9. Broberg, Niklas. Practical, Flexible programming with Information Flow Control.

Degree: 2011, University of Gothenburg / Göteborgs Universitet

 Mainstream mechanisms for protection of information security are not adequate. Most vulnerabilities today do not arise from deficiencies in network security or encryption mechanisms, but… (more)

Subjects/Keywords: Computer security; Programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Broberg, N. (2011). Practical, Flexible programming with Information Flow Control. (Thesis). University of Gothenburg / Göteborgs Universitet. Retrieved from http://hdl.handle.net/2077/26534

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

Broberg, Niklas. “Practical, Flexible programming with Information Flow Control.” 2011. Thesis, University of Gothenburg / Göteborgs Universitet. Accessed November 17, 2019. http://hdl.handle.net/2077/26534.

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

MLA Handbook (7th Edition):

Broberg, Niklas. “Practical, Flexible programming with Information Flow Control.” 2011. Web. 17 Nov 2019.

Vancouver:

Broberg N. Practical, Flexible programming with Information Flow Control. [Internet] [Thesis]. University of Gothenburg / Göteborgs Universitet; 2011. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/2077/26534.

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

Council of Science Editors:

Broberg N. Practical, Flexible programming with Information Flow Control. [Thesis]. University of Gothenburg / Göteborgs Universitet; 2011. Available from: http://hdl.handle.net/2077/26534

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


McMaster University

10. Burton, Ronald. USING DYNAMIC MIXINS FOR SOFTWARE DEVELOPMENT.

Degree: PhD, 2018, McMaster University

Object-oriented programming has gained significant traction in the software development community and is now the common approach for developing large, commercial applications. Many of these… (more)

Subjects/Keywords: programming languages, mixins; object models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Burton, R. (2018). USING DYNAMIC MIXINS FOR SOFTWARE DEVELOPMENT. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/23829

Chicago Manual of Style (16th Edition):

Burton, Ronald. “USING DYNAMIC MIXINS FOR SOFTWARE DEVELOPMENT.” 2018. Doctoral Dissertation, McMaster University. Accessed November 17, 2019. http://hdl.handle.net/11375/23829.

MLA Handbook (7th Edition):

Burton, Ronald. “USING DYNAMIC MIXINS FOR SOFTWARE DEVELOPMENT.” 2018. Web. 17 Nov 2019.

Vancouver:

Burton R. USING DYNAMIC MIXINS FOR SOFTWARE DEVELOPMENT. [Internet] [Doctoral dissertation]. McMaster University; 2018. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/11375/23829.

Council of Science Editors:

Burton R. USING DYNAMIC MIXINS FOR SOFTWARE DEVELOPMENT. [Doctoral Dissertation]. McMaster University; 2018. Available from: http://hdl.handle.net/11375/23829


University of Cambridge

11. Botinčan, Matko. Formal verification-driven parallelisation synthesis .

Degree: 2018, University of Cambridge

 Concurrency is often an optimisation, rather than intrinsic to the functional behaviour of a program, i.e., a concurrent program is often intended to achieve the… (more)

Subjects/Keywords: Programming languages; Verification; Parallelisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Botinčan, M. (2018). Formal verification-driven parallelisation synthesis . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/274136

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

Botinčan, Matko. “Formal verification-driven parallelisation synthesis .” 2018. Thesis, University of Cambridge. Accessed November 17, 2019. https://www.repository.cam.ac.uk/handle/1810/274136.

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

MLA Handbook (7th Edition):

Botinčan, Matko. “Formal verification-driven parallelisation synthesis .” 2018. Web. 17 Nov 2019.

Vancouver:

Botinčan M. Formal verification-driven parallelisation synthesis . [Internet] [Thesis]. University of Cambridge; 2018. [cited 2019 Nov 17]. Available from: https://www.repository.cam.ac.uk/handle/1810/274136.

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

Council of Science Editors:

Botinčan M. Formal verification-driven parallelisation synthesis . [Thesis]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/274136

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


University of New South Wales

12. Robinson, Amos. The stuff that streams are made of: Streaming models for concurrent execution of multiple queries.

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

 To learn from a large dataset, we generally want to perform lots of queries. If we perform each query separately, we may spend more time… (more)

Subjects/Keywords: Programming languages; Streaming; Optimisation; Fusion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Robinson, A. (2019). The stuff that streams are made of: Streaming models for concurrent execution of multiple queries. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/61695 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:56827/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Robinson, Amos. “The stuff that streams are made of: Streaming models for concurrent execution of multiple queries.” 2019. Doctoral Dissertation, University of New South Wales. Accessed November 17, 2019. http://handle.unsw.edu.au/1959.4/61695 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:56827/SOURCE02?view=true.

MLA Handbook (7th Edition):

Robinson, Amos. “The stuff that streams are made of: Streaming models for concurrent execution of multiple queries.” 2019. Web. 17 Nov 2019.

Vancouver:

Robinson A. The stuff that streams are made of: Streaming models for concurrent execution of multiple queries. [Internet] [Doctoral dissertation]. University of New South Wales; 2019. [cited 2019 Nov 17]. Available from: http://handle.unsw.edu.au/1959.4/61695 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:56827/SOURCE02?view=true.

Council of Science Editors:

Robinson A. The stuff that streams are made of: Streaming models for concurrent execution of multiple queries. [Doctoral Dissertation]. University of New South Wales; 2019. Available from: http://handle.unsw.edu.au/1959.4/61695 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:56827/SOURCE02?view=true

13. Pombrio, Justin. Resugaring: Lifting Languages through Syntactic Sugar.

Degree: Department of Computer Science, 2018, Brown University

 Syntactic sugar is pervasive in language technology. Programmers use it to shrink the size of a core language; to define domain-specific languages; and even to… (more)

Subjects/Keywords: Programming languages (Electronic computers)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pombrio, J. (2018). Resugaring: Lifting Languages through Syntactic Sugar. (Thesis). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:792916/

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

Pombrio, Justin. “Resugaring: Lifting Languages through Syntactic Sugar.” 2018. Thesis, Brown University. Accessed November 17, 2019. https://repository.library.brown.edu/studio/item/bdr:792916/.

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

MLA Handbook (7th Edition):

Pombrio, Justin. “Resugaring: Lifting Languages through Syntactic Sugar.” 2018. Web. 17 Nov 2019.

Vancouver:

Pombrio J. Resugaring: Lifting Languages through Syntactic Sugar. [Internet] [Thesis]. Brown University; 2018. [cited 2019 Nov 17]. Available from: https://repository.library.brown.edu/studio/item/bdr:792916/.

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

Council of Science Editors:

Pombrio J. Resugaring: Lifting Languages through Syntactic Sugar. [Thesis]. Brown University; 2018. Available from: https://repository.library.brown.edu/studio/item/bdr:792916/

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


University of Technology, Sydney

14. Pelchen, Thomas Albert. Evaluating the use of EiPE and the development of a domain-specific language for the novice programmer.

Degree: 2017, University of Technology, Sydney

 The purpose of this paper is to identify whether the language used by a novice when responding to an Explain in Plain English question can… (more)

Subjects/Keywords: Domain-specific programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pelchen, T. A. (2017). Evaluating the use of EiPE and the development of a domain-specific language for the novice programmer. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/121810

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

Pelchen, Thomas Albert. “Evaluating the use of EiPE and the development of a domain-specific language for the novice programmer.” 2017. Thesis, University of Technology, Sydney. Accessed November 17, 2019. http://hdl.handle.net/10453/121810.

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

MLA Handbook (7th Edition):

Pelchen, Thomas Albert. “Evaluating the use of EiPE and the development of a domain-specific language for the novice programmer.” 2017. Web. 17 Nov 2019.

Vancouver:

Pelchen TA. Evaluating the use of EiPE and the development of a domain-specific language for the novice programmer. [Internet] [Thesis]. University of Technology, Sydney; 2017. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10453/121810.

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

Council of Science Editors:

Pelchen TA. Evaluating the use of EiPE and the development of a domain-specific language for the novice programmer. [Thesis]. University of Technology, Sydney; 2017. Available from: http://hdl.handle.net/10453/121810

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


University of Arizona

15. Gaska, Benjamin James. ParForPy: Loop Parallelism in Python .

Degree: 2017, University of Arizona

 Scientists are trending towards usage of high-level programming languages such as Python. The convenience of these languages often have a performance cost. As the amount… (more)

Subjects/Keywords: Parallelism; Programming Languages; Python

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gaska, B. J. (2017). ParForPy: Loop Parallelism in Python . (Masters Thesis). University of Arizona. Retrieved from http://hdl.handle.net/10150/625320

Chicago Manual of Style (16th Edition):

Gaska, Benjamin James. “ParForPy: Loop Parallelism in Python .” 2017. Masters Thesis, University of Arizona. Accessed November 17, 2019. http://hdl.handle.net/10150/625320.

MLA Handbook (7th Edition):

Gaska, Benjamin James. “ParForPy: Loop Parallelism in Python .” 2017. Web. 17 Nov 2019.

Vancouver:

Gaska BJ. ParForPy: Loop Parallelism in Python . [Internet] [Masters thesis]. University of Arizona; 2017. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10150/625320.

Council of Science Editors:

Gaska BJ. ParForPy: Loop Parallelism in Python . [Masters Thesis]. University of Arizona; 2017. Available from: http://hdl.handle.net/10150/625320


University of Pennsylvania

16. Vaughan, Jeffrey A. Aura: Programming with Authorization and Audit.

Degree: 2009, University of Pennsylvania

 Standard programming models do not provide direct ways of managing secret or untrusted data. This is a problem because programmers must use ad hoc methods… (more)

Subjects/Keywords: access control; audit; cryptography; programming languages; types; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaughan, J. A. (2009). Aura: Programming with Authorization and Audit. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/48

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

Vaughan, Jeffrey A. “Aura: Programming with Authorization and Audit.” 2009. Thesis, University of Pennsylvania. Accessed November 17, 2019. https://repository.upenn.edu/edissertations/48.

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

MLA Handbook (7th Edition):

Vaughan, Jeffrey A. “Aura: Programming with Authorization and Audit.” 2009. Web. 17 Nov 2019.

Vancouver:

Vaughan JA. Aura: Programming with Authorization and Audit. [Internet] [Thesis]. University of Pennsylvania; 2009. [cited 2019 Nov 17]. Available from: https://repository.upenn.edu/edissertations/48.

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

Council of Science Editors:

Vaughan JA. Aura: Programming with Authorization and Audit. [Thesis]. University of Pennsylvania; 2009. Available from: https://repository.upenn.edu/edissertations/48

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

17. Novikov, Mikhail. Smart syntax highlighting for dynamically typed languages : Case: Common Lisp in Emacs .

Degree: 2010, Theseus

 Today, Java, C++ and C# being the most popular programming languages, the majority of integrated development environments are tailored for them, and, in general, for… (more)

Subjects/Keywords: programming; programming languages; dynamic languages; syntax highlighting; development environments

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Novikov, M. (2010). Smart syntax highlighting for dynamically typed languages : Case: Common Lisp in Emacs . (Thesis). Theseus. Retrieved from http://www.theseus.fi/handle/10024/23735

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

Novikov, Mikhail. “Smart syntax highlighting for dynamically typed languages : Case: Common Lisp in Emacs .” 2010. Thesis, Theseus. Accessed November 17, 2019. http://www.theseus.fi/handle/10024/23735.

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

MLA Handbook (7th Edition):

Novikov, Mikhail. “Smart syntax highlighting for dynamically typed languages : Case: Common Lisp in Emacs .” 2010. Web. 17 Nov 2019.

Vancouver:

Novikov M. Smart syntax highlighting for dynamically typed languages : Case: Common Lisp in Emacs . [Internet] [Thesis]. Theseus; 2010. [cited 2019 Nov 17]. Available from: http://www.theseus.fi/handle/10024/23735.

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

Council of Science Editors:

Novikov M. Smart syntax highlighting for dynamically typed languages : Case: Common Lisp in Emacs . [Thesis]. Theseus; 2010. Available from: http://www.theseus.fi/handle/10024/23735

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


Cal Poly

18. Tran, Andrew T. An Empirical Study of Alias Analysis Techniques.

Degree: MS, Computer Science, 2018, Cal Poly

  As software projects become larger and more complex, software optimization at that scale is only feasible through automated means. One such component of software… (more)

Subjects/Keywords: Alias Analysis; LLVM; benchmarking; Programming Languages; Instrumentation; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tran, A. T. (2018). An Empirical Study of Alias Analysis Techniques. (Masters Thesis). Cal Poly. Retrieved from https://digitalcommons.calpoly.edu/theses/1859

Chicago Manual of Style (16th Edition):

Tran, Andrew T. “An Empirical Study of Alias Analysis Techniques.” 2018. Masters Thesis, Cal Poly. Accessed November 17, 2019. https://digitalcommons.calpoly.edu/theses/1859.

MLA Handbook (7th Edition):

Tran, Andrew T. “An Empirical Study of Alias Analysis Techniques.” 2018. Web. 17 Nov 2019.

Vancouver:

Tran AT. An Empirical Study of Alias Analysis Techniques. [Internet] [Masters thesis]. Cal Poly; 2018. [cited 2019 Nov 17]. Available from: https://digitalcommons.calpoly.edu/theses/1859.

Council of Science Editors:

Tran AT. An Empirical Study of Alias Analysis Techniques. [Masters Thesis]. Cal Poly; 2018. Available from: https://digitalcommons.calpoly.edu/theses/1859


Portland State University

19. 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 November 17, 2019. 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. 17 Nov 2019.

Vancouver:

Morris JG. Type Classes and Instance Chains: A Relational Approach. [Internet] [Doctoral dissertation]. Portland State University; 2013. [cited 2019 Nov 17]. 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 Toledo

20. Armstrong, Kris A. The Separation Principle – A Principle for Programming Language Design.

Degree: MSin Engineering, College of Engineering, 2013, University of Toledo

 This thesis explores a novel and exciting new principle for programming language design. This is called the “Separation Principle”. It is derived from a language… (more)

Subjects/Keywords: Computer Science; software; separation principle; programming languages; visual programming; graphical programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Armstrong, K. A. (2013). The Separation Principle – A Principle for Programming Language Design. (Masters Thesis). University of Toledo. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=toledo1373382351

Chicago Manual of Style (16th Edition):

Armstrong, Kris A. “The Separation Principle – A Principle for Programming Language Design.” 2013. Masters Thesis, University of Toledo. Accessed November 17, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1373382351.

MLA Handbook (7th Edition):

Armstrong, Kris A. “The Separation Principle – A Principle for Programming Language Design.” 2013. Web. 17 Nov 2019.

Vancouver:

Armstrong KA. The Separation Principle – A Principle for Programming Language Design. [Internet] [Masters thesis]. University of Toledo; 2013. [cited 2019 Nov 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1373382351.

Council of Science Editors:

Armstrong KA. The Separation Principle – A Principle for Programming Language Design. [Masters Thesis]. University of Toledo; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1373382351


University of California – Santa Cruz

21. Schuster, Christopher. Towards Live Programming Environments for Statically Verified JavaScript.

Degree: Computer Science, 2018, University of California – Santa Cruz

 This dissertation includes contributions to both live programming and program verification and explores how programming environments can be designed to leverage benefits of both concepts… (more)

Subjects/Keywords: Computer science; JavaScript; Live Programming; Programming Environments; Programming Languages; Program Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schuster, C. (2018). Towards Live Programming Environments for Statically Verified JavaScript. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/6x85w65n

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

Schuster, Christopher. “Towards Live Programming Environments for Statically Verified JavaScript.” 2018. Thesis, University of California – Santa Cruz. Accessed November 17, 2019. http://www.escholarship.org/uc/item/6x85w65n.

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

MLA Handbook (7th Edition):

Schuster, Christopher. “Towards Live Programming Environments for Statically Verified JavaScript.” 2018. Web. 17 Nov 2019.

Vancouver:

Schuster C. Towards Live Programming Environments for Statically Verified JavaScript. [Internet] [Thesis]. University of California – Santa Cruz; 2018. [cited 2019 Nov 17]. Available from: http://www.escholarship.org/uc/item/6x85w65n.

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

Council of Science Editors:

Schuster C. Towards Live Programming Environments for Statically Verified JavaScript. [Thesis]. University of California – Santa Cruz; 2018. Available from: http://www.escholarship.org/uc/item/6x85w65n

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


University of Rochester

22. Dalessandro, Luke K. Preserving the appeal of transactional programming.

Degree: PhD, 2014, University of Rochester

 Transactional Memory (TM) promises a unique combination of safety, convenience, and scalability for synchronization in parallel programs. Programs are annotated with transactions designating regions of… (more)

Subjects/Keywords: Concurrent programming; Parallel programming; Programming languages; Transactional memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dalessandro, L. K. (2014). Preserving the appeal of transactional programming. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/28283

Chicago Manual of Style (16th Edition):

Dalessandro, Luke K. “Preserving the appeal of transactional programming.” 2014. Doctoral Dissertation, University of Rochester. Accessed November 17, 2019. http://hdl.handle.net/1802/28283.

MLA Handbook (7th Edition):

Dalessandro, Luke K. “Preserving the appeal of transactional programming.” 2014. Web. 17 Nov 2019.

Vancouver:

Dalessandro LK. Preserving the appeal of transactional programming. [Internet] [Doctoral dissertation]. University of Rochester; 2014. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1802/28283.

Council of Science Editors:

Dalessandro LK. Preserving the appeal of transactional programming. [Doctoral Dissertation]. University of Rochester; 2014. Available from: http://hdl.handle.net/1802/28283


University of Edinburgh

23. 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 November 17, 2019. http://hdl.handle.net/1842/35873.

MLA Handbook (7th Edition):

Fowler, Simon John. “Typed concurrent functional programming with channels, actors and sessions.” 2019. Web. 17 Nov 2019.

Vancouver:

Fowler SJ. Typed concurrent functional programming with channels, actors and sessions. [Internet] [Doctoral dissertation]. University of Edinburgh; 2019. [cited 2019 Nov 17]. 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


Georgia Tech

24. Huang, Shan Shan. Structural abstraction: a mechanism for modular program construction.

Degree: PhD, Computing, 2009, Georgia Tech

 Abstraction mechanisms in programming languages aim to allow orthogonal pieces of functionality to be developed separately; complex software can then be constructed through the composition… (more)

Subjects/Keywords: Object-oriented; Modularity; Meta-programming; Programming languages; Type systems; Programming languages (Electronic computers); Software engineering; Modular programming; Computer software Reusability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, S. S. (2009). Structural abstraction: a mechanism for modular program construction. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29632

Chicago Manual of Style (16th Edition):

Huang, Shan Shan. “Structural abstraction: a mechanism for modular program construction.” 2009. Doctoral Dissertation, Georgia Tech. Accessed November 17, 2019. http://hdl.handle.net/1853/29632.

MLA Handbook (7th Edition):

Huang, Shan Shan. “Structural abstraction: a mechanism for modular program construction.” 2009. Web. 17 Nov 2019.

Vancouver:

Huang SS. Structural abstraction: a mechanism for modular program construction. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1853/29632.

Council of Science Editors:

Huang SS. Structural abstraction: a mechanism for modular program construction. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29632


Macquarie University

25. 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 November 17, 2019. http://hdl.handle.net/1959.14/337819.

MLA Handbook (7th Edition):

Roberts, Matthew. “Compiled generics for functional programming languages.” 2011. Web. 17 Nov 2019.

Vancouver:

Roberts M. Compiled generics for functional programming languages. [Internet] [Doctoral dissertation]. Macquarie University; 2011. [cited 2019 Nov 17]. 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


Victoria University of Wellington

26. Muschevici, Radu. Multiple Dispatch in Practice.

Degree: 2009, Victoria University of Wellington

 Multiple dispatch uses the run time types of more than one argument to a method call to determine which method body to run. While several… (more)

Subjects/Keywords: Programming languages; Corpus analysis; Multiple dispatch

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Muschevici, R. (2009). Multiple Dispatch in Practice. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/862

Chicago Manual of Style (16th Edition):

Muschevici, Radu. “Multiple Dispatch in Practice.” 2009. Masters Thesis, Victoria University of Wellington. Accessed November 17, 2019. http://hdl.handle.net/10063/862.

MLA Handbook (7th Edition):

Muschevici, Radu. “Multiple Dispatch in Practice.” 2009. Web. 17 Nov 2019.

Vancouver:

Muschevici R. Multiple Dispatch in Practice. [Internet] [Masters thesis]. Victoria University of Wellington; 2009. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10063/862.

Council of Science Editors:

Muschevici R. Multiple Dispatch in Practice. [Masters Thesis]. Victoria University of Wellington; 2009. Available from: http://hdl.handle.net/10063/862


Victoria University of Wellington

27. Schmager, Frank. Evaluating the GO Programming Language with Design Patterns.

Degree: 2010, Victoria University of Wellington

 GO is a new object-oriented programming language developed at Google by Rob Pike, Ken Thompson, and others. GO has the potential to become a major… (more)

Subjects/Keywords: GO; Design patterns; Programming languages; Evaluation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schmager, F. (2010). Evaluating the GO Programming Language with Design Patterns. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1553

Chicago Manual of Style (16th Edition):

Schmager, Frank. “Evaluating the GO Programming Language with Design Patterns.” 2010. Masters Thesis, Victoria University of Wellington. Accessed November 17, 2019. http://hdl.handle.net/10063/1553.

MLA Handbook (7th Edition):

Schmager, Frank. “Evaluating the GO Programming Language with Design Patterns.” 2010. Web. 17 Nov 2019.

Vancouver:

Schmager F. Evaluating the GO Programming Language with Design Patterns. [Internet] [Masters thesis]. Victoria University of Wellington; 2010. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10063/1553.

Council of Science Editors:

Schmager F. Evaluating the GO Programming Language with Design Patterns. [Masters Thesis]. Victoria University of Wellington; 2010. Available from: http://hdl.handle.net/10063/1553


University of Vermont

28. Norton, Rebecca C. Messaging in Scalaness: A Programming Language for Wireless Sensor Networks.

Degree: Computer Science, 2014, University of Vermont

  This paper presents the design and implementation of three types of messaging primitives for the Scalaness programming language. The main idea behind this project… (more)

Subjects/Keywords: programming languages; wireless sensor networks; network communication

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Norton, R. C. (2014). Messaging in Scalaness: A Programming Language for Wireless Sensor Networks. (Thesis). University of Vermont. Retrieved from https://scholarworks.uvm.edu/hcoltheses/40

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

Norton, Rebecca C. “Messaging in Scalaness: A Programming Language for Wireless Sensor Networks.” 2014. Thesis, University of Vermont. Accessed November 17, 2019. https://scholarworks.uvm.edu/hcoltheses/40.

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

MLA Handbook (7th Edition):

Norton, Rebecca C. “Messaging in Scalaness: A Programming Language for Wireless Sensor Networks.” 2014. Web. 17 Nov 2019.

Vancouver:

Norton RC. Messaging in Scalaness: A Programming Language for Wireless Sensor Networks. [Internet] [Thesis]. University of Vermont; 2014. [cited 2019 Nov 17]. Available from: https://scholarworks.uvm.edu/hcoltheses/40.

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

Council of Science Editors:

Norton RC. Messaging in Scalaness: A Programming Language for Wireless Sensor Networks. [Thesis]. University of Vermont; 2014. Available from: https://scholarworks.uvm.edu/hcoltheses/40

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


EPFL

29. Rompf, Tiark. Lightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming.

Degree: 2012, EPFL

 Programs expressed in a high-level programming language need to be translated to a low-level machine dialect for execution. This translation is usually accomplished by a… (more)

Subjects/Keywords: Programming Languages; Compilers; Staging; Performance; Parallelism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rompf, T. (2012). Lightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/180642

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

Rompf, Tiark. “Lightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming.” 2012. Thesis, EPFL. Accessed November 17, 2019. http://infoscience.epfl.ch/record/180642.

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

MLA Handbook (7th Edition):

Rompf, Tiark. “Lightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming.” 2012. Web. 17 Nov 2019.

Vancouver:

Rompf T. Lightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming. [Internet] [Thesis]. EPFL; 2012. [cited 2019 Nov 17]. Available from: http://infoscience.epfl.ch/record/180642.

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

Council of Science Editors:

Rompf T. Lightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming. [Thesis]. EPFL; 2012. Available from: http://infoscience.epfl.ch/record/180642

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


Rhodes University

30. 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 November 17, 2019. 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. 17 Nov 2019.

Vancouver:

Mountjoy J. Static analysis of functional languages. [Internet] [Thesis]. Rhodes University; 1994. [cited 2019 Nov 17]. 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

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

.