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:(type inference). Showing records 1 – 30 of 40 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters


Universiteit Utrecht

1. Naus, N. Dynamic type inference for JavaScript.

Degree: 2015, Universiteit Utrecht

 With this master thesis, we have shown that Dynamic Type Inference is a feasi- ble method for doing type inference for JavaScript. The idea of… (more)

Subjects/Keywords: JavaScript; Type Inference; Automatic Program Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naus, N. (2015). Dynamic type inference for JavaScript. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/319986

Chicago Manual of Style (16th Edition):

Naus, N. “Dynamic type inference for JavaScript.” 2015. Masters Thesis, Universiteit Utrecht. Accessed August 18, 2019. http://dspace.library.uu.nl:8080/handle/1874/319986.

MLA Handbook (7th Edition):

Naus, N. “Dynamic type inference for JavaScript.” 2015. Web. 18 Aug 2019.

Vancouver:

Naus N. Dynamic type inference for JavaScript. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Aug 18]. Available from: http://dspace.library.uu.nl:8080/handle/1874/319986.

Council of Science Editors:

Naus N. Dynamic type inference for JavaScript. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/319986


University of Technology, Sydney

2. Heise, Ryan. Extensible records in the System E Framework and a new approach to object-oriented type inference.

Degree: 2013, University of Technology, Sydney

 Extensible records were proposed by Wand as a foundation for studying object-oriented type inference. One of their key benefits is that they allow for an… (more)

Subjects/Keywords: Type inference.; Object orientation.; Extensible records.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heise, R. (2013). Extensible records in the System E Framework and a new approach to object-oriented type inference. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/24178

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

Heise, Ryan. “Extensible records in the System E Framework and a new approach to object-oriented type inference.” 2013. Thesis, University of Technology, Sydney. Accessed August 18, 2019. http://hdl.handle.net/10453/24178.

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

MLA Handbook (7th Edition):

Heise, Ryan. “Extensible records in the System E Framework and a new approach to object-oriented type inference.” 2013. Web. 18 Aug 2019.

Vancouver:

Heise R. Extensible records in the System E Framework and a new approach to object-oriented type inference. [Internet] [Thesis]. University of Technology, Sydney; 2013. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10453/24178.

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

Council of Science Editors:

Heise R. Extensible records in the System E Framework and a new approach to object-oriented type inference. [Thesis]. University of Technology, Sydney; 2013. Available from: http://hdl.handle.net/10453/24178

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


University of Saskatchewan

3. Hnativ, Andriy. Principal typings for interactive ruby programming.

Degree: 2009, University of Saskatchewan

 A novel and promising method of software development is the interactive style of development, where code is written and incrementally tested simultaneously. Interpreted dynamic languages… (more)

Subjects/Keywords: principal typings; dynamic languages; type inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hnativ, A. (2009). Principal typings for interactive ruby programming. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-12162009-144405

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

Hnativ, Andriy. “Principal typings for interactive ruby programming.” 2009. Thesis, University of Saskatchewan. Accessed August 18, 2019. http://hdl.handle.net/10388/etd-12162009-144405.

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

MLA Handbook (7th Edition):

Hnativ, Andriy. “Principal typings for interactive ruby programming.” 2009. Web. 18 Aug 2019.

Vancouver:

Hnativ A. Principal typings for interactive ruby programming. [Internet] [Thesis]. University of Saskatchewan; 2009. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10388/etd-12162009-144405.

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

Council of Science Editors:

Hnativ A. Principal typings for interactive ruby programming. [Thesis]. University of Saskatchewan; 2009. Available from: http://hdl.handle.net/10388/etd-12162009-144405

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


Wright State University

4. Frasure, Ivan. Static Evaluation of Type Inference and Propagation on Global Variables with Varying Context.

Degree: MSCE, Computer Engineering, 2019, Wright State University

 Software reverse engineering (SRE) is a broad field with motivations rangingfrom verifying or documenting gordian source code files to understanding andreimplementing binary object files and… (more)

Subjects/Keywords: Computer Engineering; binary; reverse engineering; type inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Frasure, I. (2019). Static Evaluation of Type Inference and Propagation on Global Variables with Varying Context. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1559667148325266

Chicago Manual of Style (16th Edition):

Frasure, Ivan. “Static Evaluation of Type Inference and Propagation on Global Variables with Varying Context.” 2019. Masters Thesis, Wright State University. Accessed August 18, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1559667148325266.

MLA Handbook (7th Edition):

Frasure, Ivan. “Static Evaluation of Type Inference and Propagation on Global Variables with Varying Context.” 2019. Web. 18 Aug 2019.

Vancouver:

Frasure I. Static Evaluation of Type Inference and Propagation on Global Variables with Varying Context. [Internet] [Masters thesis]. Wright State University; 2019. [cited 2019 Aug 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1559667148325266.

Council of Science Editors:

Frasure I. Static Evaluation of Type Inference and Propagation on Global Variables with Varying Context. [Masters Thesis]. Wright State University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1559667148325266


Universidade Nova

5. Lourenço, Maria Luísa Sobreira Gouveia. Type inference for conversation types.

Degree: 2009, Universidade Nova

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

This dissertation tackles the… (more)

Subjects/Keywords: Service-oriented computing; Type systems; Type inference; Conversations; Conversation types

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lourenço, M. L. S. G. (2009). Type inference for conversation types. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/3960

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

Lourenço, Maria Luísa Sobreira Gouveia. “Type inference for conversation types.” 2009. Thesis, Universidade Nova. Accessed August 18, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/3960.

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

MLA Handbook (7th Edition):

Lourenço, Maria Luísa Sobreira Gouveia. “Type inference for conversation types.” 2009. Web. 18 Aug 2019.

Vancouver:

Lourenço MLSG. Type inference for conversation types. [Internet] [Thesis]. Universidade Nova; 2009. [cited 2019 Aug 18]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/3960.

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

Council of Science Editors:

Lourenço MLSG. Type inference for conversation types. [Thesis]. Universidade Nova; 2009. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/3960

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


Universidade Nova

6. Piriquito, Maria Margarida Lameira da Cunha. Type System for the ComponentJ Programming Language.

Degree: 2009, Universidade Nova

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Informática.

With the… (more)

Subjects/Keywords: Component orientation; Type systems; Dynamic reconfiguration; Subtyping; Type inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Piriquito, M. M. L. d. C. (2009). Type System for the ComponentJ Programming Language. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2015

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

Piriquito, Maria Margarida Lameira da Cunha. “Type System for the ComponentJ Programming Language.” 2009. Thesis, Universidade Nova. Accessed August 18, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2015.

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

MLA Handbook (7th Edition):

Piriquito, Maria Margarida Lameira da Cunha. “Type System for the ComponentJ Programming Language.” 2009. Web. 18 Aug 2019.

Vancouver:

Piriquito MMLdC. Type System for the ComponentJ Programming Language. [Internet] [Thesis]. Universidade Nova; 2009. [cited 2019 Aug 18]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2015.

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

Council of Science Editors:

Piriquito MMLdC. Type System for the ComponentJ Programming Language. [Thesis]. Universidade Nova; 2009. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2015

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


Wayne State University

7. Khalaj, Mohammad Ebrahim. Automated Refinement Of Hierarchical Object Graphs.

Degree: PhD, Computer Science, 2017, Wayne State University

  Object graphs help explain the runtime structure of a system. To make object graphs convey design intent, one insight is to use abstraction by… (more)

Subjects/Keywords: object graphs; ownership inference; ownership type inference; ownership types; points-to graphs; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khalaj, M. E. (2017). Automated Refinement Of Hierarchical Object Graphs. (Doctoral Dissertation). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_dissertations/1715

Chicago Manual of Style (16th Edition):

Khalaj, Mohammad Ebrahim. “Automated Refinement Of Hierarchical Object Graphs.” 2017. Doctoral Dissertation, Wayne State University. Accessed August 18, 2019. https://digitalcommons.wayne.edu/oa_dissertations/1715.

MLA Handbook (7th Edition):

Khalaj, Mohammad Ebrahim. “Automated Refinement Of Hierarchical Object Graphs.” 2017. Web. 18 Aug 2019.

Vancouver:

Khalaj ME. Automated Refinement Of Hierarchical Object Graphs. [Internet] [Doctoral dissertation]. Wayne State University; 2017. [cited 2019 Aug 18]. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1715.

Council of Science Editors:

Khalaj ME. Automated Refinement Of Hierarchical Object Graphs. [Doctoral Dissertation]. Wayne State University; 2017. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1715


Universidade Nova

8. Militão, Filipe David Oliveira. Design and implementation of a behaviorally typed programming system for web services.

Degree: 2008, Universidade Nova

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática.

The growing… (more)

Subjects/Keywords: Web services; Behavioral typechecking; Resource usage analysis; Type system; Type inference; Scripting language

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Militão, F. D. O. (2008). Design and implementation of a behaviorally typed programming system for web services. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/1792

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

Militão, Filipe David Oliveira. “Design and implementation of a behaviorally typed programming system for web services.” 2008. Thesis, Universidade Nova. Accessed August 18, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/1792.

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

MLA Handbook (7th Edition):

Militão, Filipe David Oliveira. “Design and implementation of a behaviorally typed programming system for web services.” 2008. Web. 18 Aug 2019.

Vancouver:

Militão FDO. Design and implementation of a behaviorally typed programming system for web services. [Internet] [Thesis]. Universidade Nova; 2008. [cited 2019 Aug 18]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/1792.

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

Council of Science Editors:

Militão FDO. Design and implementation of a behaviorally typed programming system for web services. [Thesis]. Universidade Nova; 2008. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/1792

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


University of Waterloo

9. Domurad, Adam. Static Types with Less Syntax: Locus Types.

Degree: 2017, University of Waterloo

 Optionally and gradually-typed languages allow types to be introduced to dynamic code as needed. While this approach allows some gradual movement from dynamically to statically-typed… (more)

Subjects/Keywords: Gradual typing; programming languages; type inference; JavaScript; optional typing; TypeScript; type systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Domurad, A. (2017). Static Types with Less Syntax: Locus Types. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11839

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

Domurad, Adam. “Static Types with Less Syntax: Locus Types.” 2017. Thesis, University of Waterloo. Accessed August 18, 2019. http://hdl.handle.net/10012/11839.

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

MLA Handbook (7th Edition):

Domurad, Adam. “Static Types with Less Syntax: Locus Types.” 2017. Web. 18 Aug 2019.

Vancouver:

Domurad A. Static Types with Less Syntax: Locus Types. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10012/11839.

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

Council of Science Editors:

Domurad A. Static Types with Less Syntax: Locus Types. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11839

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


University of Edinburgh

10. Sequeira, Dilip. Type inference with bounded quantification.

Degree: PhD, 1998, University of Edinburgh

 In this thesis we study some of the problems which occur when type inference is used in a type system with subtyping. An underlying poset… (more)

Subjects/Keywords: 530.15; type inference; Bounded Quantification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sequeira, D. (1998). Type inference with bounded quantification. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/503

Chicago Manual of Style (16th Edition):

Sequeira, Dilip. “Type inference with bounded quantification.” 1998. Doctoral Dissertation, University of Edinburgh. Accessed August 18, 2019. http://hdl.handle.net/1842/503.

MLA Handbook (7th Edition):

Sequeira, Dilip. “Type inference with bounded quantification.” 1998. Web. 18 Aug 2019.

Vancouver:

Sequeira D. Type inference with bounded quantification. [Internet] [Doctoral dissertation]. University of Edinburgh; 1998. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1842/503.

Council of Science Editors:

Sequeira D. Type inference with bounded quantification. [Doctoral Dissertation]. University of Edinburgh; 1998. Available from: http://hdl.handle.net/1842/503

11. Husein, Mustafa. A Type-inferencing Mechanism for Automatically Detecting Variable Types in System Requirements Specifications.

Degree: Design and Engineering, 2018, Mälardalen University

  A system requirements specification (SyRS) defines a set of functionalities that a system is expected to fulfil. A requirement may be “it is always… (more)

Subjects/Keywords: system requirements specification; type-inference; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Husein, M. (2018). A Type-inferencing Mechanism for Automatically Detecting Variable Types in System Requirements Specifications. (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-39667

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

Husein, Mustafa. “A Type-inferencing Mechanism for Automatically Detecting Variable Types in System Requirements Specifications.” 2018. Thesis, Mälardalen University. Accessed August 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-39667.

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

MLA Handbook (7th Edition):

Husein, Mustafa. “A Type-inferencing Mechanism for Automatically Detecting Variable Types in System Requirements Specifications.” 2018. Web. 18 Aug 2019.

Vancouver:

Husein M. A Type-inferencing Mechanism for Automatically Detecting Variable Types in System Requirements Specifications. [Internet] [Thesis]. Mälardalen University; 2018. [cited 2019 Aug 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-39667.

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

Council of Science Editors:

Husein M. A Type-inferencing Mechanism for Automatically Detecting Variable Types in System Requirements Specifications. [Thesis]. Mälardalen University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-39667

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


McMaster University

12. Ye, Yang. Likelihood Inference for Type I Bivariate Polya-Aeppli Distribution.

Degree: MSc, 2015, McMaster University

The Poisson distribution is commonly used in analyzing count data, and many insurance companies are interested in studying the related risk models and ruin probability… (more)

Subjects/Keywords: Likelihood Inference Type I Bivariate Polya-Aeppli Distribution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ye, Y. (2015). Likelihood Inference for Type I Bivariate Polya-Aeppli Distribution. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/18427

Chicago Manual of Style (16th Edition):

Ye, Yang. “Likelihood Inference for Type I Bivariate Polya-Aeppli Distribution.” 2015. Masters Thesis, McMaster University. Accessed August 18, 2019. http://hdl.handle.net/11375/18427.

MLA Handbook (7th Edition):

Ye, Yang. “Likelihood Inference for Type I Bivariate Polya-Aeppli Distribution.” 2015. Web. 18 Aug 2019.

Vancouver:

Ye Y. Likelihood Inference for Type I Bivariate Polya-Aeppli Distribution. [Internet] [Masters thesis]. McMaster University; 2015. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/11375/18427.

Council of Science Editors:

Ye Y. Likelihood Inference for Type I Bivariate Polya-Aeppli Distribution. [Masters Thesis]. McMaster University; 2015. Available from: http://hdl.handle.net/11375/18427


University of Illinois – Urbana-Champaign

13. Vakilian, Mohsen. Inferring Method Effect Summaries for Nested Heap Regions.

Degree: MS, Computer Science, 2009, University of Illinois – Urbana-Champaign

 Effect systems are important for reasoning about the side effects of a program. Although effect systems have been around for decades, they have not been… (more)

Subjects/Keywords: refactoring; parallelism; type systems; inference; object-oriented programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vakilian, M. (2009). Inferring Method Effect Summaries for Nested Heap Regions. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/17342

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

Vakilian, Mohsen. “Inferring Method Effect Summaries for Nested Heap Regions.” 2009. Thesis, University of Illinois – Urbana-Champaign. Accessed August 18, 2019. http://hdl.handle.net/2142/17342.

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

MLA Handbook (7th Edition):

Vakilian, Mohsen. “Inferring Method Effect Summaries for Nested Heap Regions.” 2009. Web. 18 Aug 2019.

Vancouver:

Vakilian M. Inferring Method Effect Summaries for Nested Heap Regions. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2009. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/2142/17342.

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

Council of Science Editors:

Vakilian M. Inferring Method Effect Summaries for Nested Heap Regions. [Thesis]. University of Illinois – Urbana-Champaign; 2009. Available from: http://hdl.handle.net/2142/17342

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


Penn State University

14. Huhman, Ashley. Binary-Level Type Inference using Datalog.

Degree: 2018, Penn State University

 The Doop framework is evidence that the Datalog programming language can be used to implement entire non-trivial program analyses while maintaining high precision and scalability.… (more)

Subjects/Keywords: Datalog; Control Flow Graph construction; Type Inference analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huhman, A. (2018). Binary-Level Type Inference using Datalog. (Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/15197abh7

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

Huhman, Ashley. “Binary-Level Type Inference using Datalog.” 2018. Thesis, Penn State University. Accessed August 18, 2019. https://etda.libraries.psu.edu/catalog/15197abh7.

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

MLA Handbook (7th Edition):

Huhman, Ashley. “Binary-Level Type Inference using Datalog.” 2018. Web. 18 Aug 2019.

Vancouver:

Huhman A. Binary-Level Type Inference using Datalog. [Internet] [Thesis]. Penn State University; 2018. [cited 2019 Aug 18]. Available from: https://etda.libraries.psu.edu/catalog/15197abh7.

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

Council of Science Editors:

Huhman A. Binary-Level Type Inference using Datalog. [Thesis]. Penn State University; 2018. Available from: https://etda.libraries.psu.edu/catalog/15197abh7

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


McMaster University

15. Su, Feng. Exact likelihood inference for multiple exponential populations under joint censoring.

Degree: PhD, 2012, McMaster University

The joint censoring scheme is of practical significance while conducting comparative life-tests of products from different units within the same facility. In this thesis,… (more)

Subjects/Keywords: Exponential distribution; Joint progressive Type-II censoring; Joint Type-II hybrid censoring; Joint Type-I hybrid censoring; Likelihood inference; Bayesian inference; Statistical Theory; Statistical Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Su, F. (2012). Exact likelihood inference for multiple exponential populations under joint censoring. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/12727

Chicago Manual of Style (16th Edition):

Su, Feng. “Exact likelihood inference for multiple exponential populations under joint censoring.” 2012. Doctoral Dissertation, McMaster University. Accessed August 18, 2019. http://hdl.handle.net/11375/12727.

MLA Handbook (7th Edition):

Su, Feng. “Exact likelihood inference for multiple exponential populations under joint censoring.” 2012. Web. 18 Aug 2019.

Vancouver:

Su F. Exact likelihood inference for multiple exponential populations under joint censoring. [Internet] [Doctoral dissertation]. McMaster University; 2012. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/11375/12727.

Council of Science Editors:

Su F. Exact likelihood inference for multiple exponential populations under joint censoring. [Doctoral Dissertation]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12727


University of Illinois – Urbana-Champaign

16. Vakilian, Mohsen. Less is sometimes more in the automation of software evolution tasks.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

 Software rapidly evolves. A refactoring is a code change that preserves the behavior of the program. There has been much interest in automation to make… (more)

Subjects/Keywords: Software Engineering; Human-Computer Interaction; Programming Languages; Empirical; Refactoring; Program Transformation; Type Qualifier Inference; Type System; Type Inference; Compositional; Critical Incident Technique; Usability Evaluation Methodology; Software Evolution; Programming Environment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vakilian, M. (2014). Less is sometimes more in the automation of software evolution tasks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50602

Chicago Manual of Style (16th Edition):

Vakilian, Mohsen. “Less is sometimes more in the automation of software evolution tasks.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 18, 2019. http://hdl.handle.net/2142/50602.

MLA Handbook (7th Edition):

Vakilian, Mohsen. “Less is sometimes more in the automation of software evolution tasks.” 2014. Web. 18 Aug 2019.

Vancouver:

Vakilian M. Less is sometimes more in the automation of software evolution tasks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/2142/50602.

Council of Science Editors:

Vakilian M. Less is sometimes more in the automation of software evolution tasks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50602


University of Waterloo

17. Moss, Aaron. C∀ Type System Implementation.

Degree: 2019, University of Waterloo

 The C programming language has been an important software development tool for decades. C∀ is a new programming language designed with strong backwards-compatibility to take… (more)

Subjects/Keywords: programming languages; type inference; C language; polymorphism; generic types; expression resolution; type environment; union-find; name overloading; compiler construction; C∀

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moss, A. (2019). C∀ Type System Implementation. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14584

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

Moss, Aaron. “C∀ Type System Implementation.” 2019. Thesis, University of Waterloo. Accessed August 18, 2019. http://hdl.handle.net/10012/14584.

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

MLA Handbook (7th Edition):

Moss, Aaron. “C∀ Type System Implementation.” 2019. Web. 18 Aug 2019.

Vancouver:

Moss A. C∀ Type System Implementation. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10012/14584.

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

Council of Science Editors:

Moss A. C∀ Type System Implementation. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14584

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


KTH

18. Lund, Jonas. Ahead of Time Compilation of EcmaScript Code Using Type Inference.

Degree: Computer Science and Communication (CSC), 2015, KTH

  To investigate the feasibility of improving performance for EcmaScript code in environments that restricts the usage of dynamic just in time compilers, an ahead… (more)

Subjects/Keywords: EcmaScript; JavaScript; Compilation; Compilers; Type Inference; Cartesian Product Algorithm; Games; Media and Communication Technology; Medieteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lund, J. (2015). Ahead of Time Compilation of EcmaScript Code Using Type Inference. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169607

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

Lund, Jonas. “Ahead of Time Compilation of EcmaScript Code Using Type Inference.” 2015. Thesis, KTH. Accessed August 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169607.

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

MLA Handbook (7th Edition):

Lund, Jonas. “Ahead of Time Compilation of EcmaScript Code Using Type Inference.” 2015. Web. 18 Aug 2019.

Vancouver:

Lund J. Ahead of Time Compilation of EcmaScript Code Using Type Inference. [Internet] [Thesis]. KTH; 2015. [cited 2019 Aug 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169607.

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

Council of Science Editors:

Lund J. Ahead of Time Compilation of EcmaScript Code Using Type Inference. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169607

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


Brno University of Technology

19. Falhar, Radek. Překladač podmnožiny jazyka Python .

Degree: 2014, Brno University of Technology

 Python  je  dynamicky  typovaný,  interpretovaný  programovací  jazyk.  Díky  dynamickému  typovému  systému je tedy obtížné jej zkompilovat do statického zdrojového kódu. Tedy kódu, kde je přesně… (more)

Subjects/Keywords: Python; překladač; typová inference; C++; Hindley-Millner; Python; compiler; type inferrence; C++; Hindley-Millner

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Falhar, R. (2014). Překladač podmnožiny jazyka Python . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53268

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

Falhar, Radek. “Překladač podmnožiny jazyka Python .” 2014. Thesis, Brno University of Technology. Accessed August 18, 2019. http://hdl.handle.net/11012/53268.

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

MLA Handbook (7th Edition):

Falhar, Radek. “Překladač podmnožiny jazyka Python .” 2014. Web. 18 Aug 2019.

Vancouver:

Falhar R. Překladač podmnožiny jazyka Python . [Internet] [Thesis]. Brno University of Technology; 2014. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/11012/53268.

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

Council of Science Editors:

Falhar R. Překladač podmnožiny jazyka Python . [Thesis]. Brno University of Technology; 2014. Available from: http://hdl.handle.net/11012/53268

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


University of Western Ontario

20. Burrell, Michael J. Resource Bound Guarantees via Programming Languages.

Degree: 2017, University of Western Ontario

 We present a programming language in which every well-typed program halts in time polynomial with respect to its input and, more importantly, in which upper… (more)

Subjects/Keywords: programming language; static analysis; resource bounds; type inference; polynomial time; time complexity; category theory; 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):

Burrell, M. J. (2017). Resource Bound Guarantees via Programming Languages. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/4740

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

Burrell, Michael J. “Resource Bound Guarantees via Programming Languages.” 2017. Thesis, University of Western Ontario. Accessed August 18, 2019. https://ir.lib.uwo.ca/etd/4740.

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

MLA Handbook (7th Edition):

Burrell, Michael J. “Resource Bound Guarantees via Programming Languages.” 2017. Web. 18 Aug 2019.

Vancouver:

Burrell MJ. Resource Bound Guarantees via Programming Languages. [Internet] [Thesis]. University of Western Ontario; 2017. [cited 2019 Aug 18]. Available from: https://ir.lib.uwo.ca/etd/4740.

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

Council of Science Editors:

Burrell MJ. Resource Bound Guarantees via Programming Languages. [Thesis]. University of Western Ontario; 2017. Available from: https://ir.lib.uwo.ca/etd/4740

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


University of Waterloo

21. Lushman, Bradley. Direct and Expressive Type Inference for the Rank 2 Fragment of System F.

Degree: 2007, University of Waterloo

 This thesis develops a semiunification-based type inference procedure for the rank 2 fragment of System F, with an emphasis on practical considerations for the adoption… (more)

Subjects/Keywords: programming languages; type inference; System F; semiunification; rank 2

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lushman, B. (2007). Direct and Expressive Type Inference for the Rank 2 Fragment of System F. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3267

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

Lushman, Bradley. “Direct and Expressive Type Inference for the Rank 2 Fragment of System F.” 2007. Thesis, University of Waterloo. Accessed August 18, 2019. http://hdl.handle.net/10012/3267.

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

MLA Handbook (7th Edition):

Lushman, Bradley. “Direct and Expressive Type Inference for the Rank 2 Fragment of System F.” 2007. Web. 18 Aug 2019.

Vancouver:

Lushman B. Direct and Expressive Type Inference for the Rank 2 Fragment of System F. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10012/3267.

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

Council of Science Editors:

Lushman B. Direct and Expressive Type Inference for the Rank 2 Fragment of System F. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3267

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


North Carolina State University

22. Wright, David Richard. Type-based Static Analysis of Web Documents with Embedded Executable Components.

Degree: MS, Computer Science, 2003, North Carolina State University

 Electronic documents have become an important medium for the exchange of information, and nowhere is this more evident than on the World Wide Web. Web-based… (more)

Subjects/Keywords: static analysis; javascript; document analysis; type inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wright, D. R. (2003). Type-based Static Analysis of Web Documents with Embedded Executable Components. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1926

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 Richard. “Type-based Static Analysis of Web Documents with Embedded Executable Components.” 2003. Thesis, North Carolina State University. Accessed August 18, 2019. http://www.lib.ncsu.edu/resolver/1840.16/1926.

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 Richard. “Type-based Static Analysis of Web Documents with Embedded Executable Components.” 2003. Web. 18 Aug 2019.

Vancouver:

Wright DR. Type-based Static Analysis of Web Documents with Embedded Executable Components. [Internet] [Thesis]. North Carolina State University; 2003. [cited 2019 Aug 18]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1926.

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

Council of Science Editors:

Wright DR. Type-based Static Analysis of Web Documents with Embedded Executable Components. [Thesis]. North Carolina State University; 2003. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1926

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


University of Tasmania

23. Hepburn, M. Integrity Analysis and Coercion in Distributed Systems.

Degree: 2006, University of Tasmania

 This thesis presents a new approach to modelling the security and integrity of data in distributed and ad-hoc networks of processes. An annotated type based… (more)

Subjects/Keywords: 280100 Information Systems; trust; integrity analysis; pi-calculus; type inference; type systems; security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hepburn, M. (2006). Integrity Analysis and Coercion in Distributed Systems. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/390/1/thesis.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):

Hepburn, M. “Integrity Analysis and Coercion in Distributed Systems.” 2006. Thesis, University of Tasmania. Accessed August 18, 2019. https://eprints.utas.edu.au/390/1/thesis.pdf.

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

MLA Handbook (7th Edition):

Hepburn, M. “Integrity Analysis and Coercion in Distributed Systems.” 2006. Web. 18 Aug 2019.

Vancouver:

Hepburn M. Integrity Analysis and Coercion in Distributed Systems. [Internet] [Thesis]. University of Tasmania; 2006. [cited 2019 Aug 18]. Available from: https://eprints.utas.edu.au/390/1/thesis.pdf.

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

Council of Science Editors:

Hepburn M. Integrity Analysis and Coercion in Distributed Systems. [Thesis]. University of Tasmania; 2006. Available from: https://eprints.utas.edu.au/390/1/thesis.pdf

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


Carnegie Mellon University

24. Beckman, Nels E. Types for Correct Concurrent API Usage.

Degree: 2010, Carnegie Mellon University

 This thesis represents an attempt to improve the state of the art in our ability tounderstand and check object protocols, with a particular emphasis on… (more)

Subjects/Keywords: API; object protocol; typestate; concurrency; multi-threading; object-oriented; type theory; type system; static analysis; specification; verification; Java; empirical; polymor- phism; inference; probabilistic; transactional memory; STM; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beckman, N. E. (2010). Types for Correct Concurrent API Usage. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/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):

Beckman, Nels E. “Types for Correct Concurrent API Usage.” 2010. Thesis, Carnegie Mellon University. Accessed August 18, 2019. http://repository.cmu.edu/dissertations/40.

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

MLA Handbook (7th Edition):

Beckman, Nels E. “Types for Correct Concurrent API Usage.” 2010. Web. 18 Aug 2019.

Vancouver:

Beckman NE. Types for Correct Concurrent API Usage. [Internet] [Thesis]. Carnegie Mellon University; 2010. [cited 2019 Aug 18]. Available from: http://repository.cmu.edu/dissertations/40.

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

Council of Science Editors:

Beckman NE. Types for Correct Concurrent API Usage. [Thesis]. Carnegie Mellon University; 2010. Available from: http://repository.cmu.edu/dissertations/40

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

25. Serrano, Alejandro. Type Error Customization for Embedded Domain-Specific Languages.

Degree: 2018, University Utrecht

 Domain-specific languages (DSLs) are a widely used technique in the programming world, since they make communication between experts and developers more fluid. Some well-known examples… (more)

Subjects/Keywords: domain-specific languages; type errors; functional programming; CHRs; type inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Serrano, A. (2018). Type Error Customization for Embedded Domain-Specific Languages. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/363523 ; URN:NBN:NL:UI:10-1874-363523 ; URN:NBN:NL:UI:10-1874-363523 ; http://dspace.library.uu.nl/handle/1874/363523

Chicago Manual of Style (16th Edition):

Serrano, Alejandro. “Type Error Customization for Embedded Domain-Specific Languages.” 2018. Doctoral Dissertation, University Utrecht. Accessed August 18, 2019. http://dspace.library.uu.nl/handle/1874/363523 ; URN:NBN:NL:UI:10-1874-363523 ; URN:NBN:NL:UI:10-1874-363523 ; http://dspace.library.uu.nl/handle/1874/363523.

MLA Handbook (7th Edition):

Serrano, Alejandro. “Type Error Customization for Embedded Domain-Specific Languages.” 2018. Web. 18 Aug 2019.

Vancouver:

Serrano A. Type Error Customization for Embedded Domain-Specific Languages. [Internet] [Doctoral dissertation]. University Utrecht; 2018. [cited 2019 Aug 18]. Available from: http://dspace.library.uu.nl/handle/1874/363523 ; URN:NBN:NL:UI:10-1874-363523 ; URN:NBN:NL:UI:10-1874-363523 ; http://dspace.library.uu.nl/handle/1874/363523.

Council of Science Editors:

Serrano A. Type Error Customization for Embedded Domain-Specific Languages. [Doctoral Dissertation]. University Utrecht; 2018. Available from: http://dspace.library.uu.nl/handle/1874/363523 ; URN:NBN:NL:UI:10-1874-363523 ; URN:NBN:NL:UI:10-1874-363523 ; http://dspace.library.uu.nl/handle/1874/363523


Universiteit Utrecht

26. Heeren, B.J. Top quality type error Messages.

Degree: 2005, Universiteit Utrecht

 Flaws in computer software are a fact of life, both in small and large-scale applications. Compilers for modern programming languages accommodate many program analyses for… (more)

Subjects/Keywords: Wiskunde en Informatica; constraints; type inference; type error messages; type systems; directives; domain-specific programming; functional programming; heuristics; compiler construction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heeren, B. J. (2005). Top quality type error Messages. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/7297

Chicago Manual of Style (16th Edition):

Heeren, B J. “Top quality type error Messages.” 2005. Doctoral Dissertation, Universiteit Utrecht. Accessed August 18, 2019. http://dspace.library.uu.nl:8080/handle/1874/7297.

MLA Handbook (7th Edition):

Heeren, B J. “Top quality type error Messages.” 2005. Web. 18 Aug 2019.

Vancouver:

Heeren BJ. Top quality type error Messages. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 2005. [cited 2019 Aug 18]. Available from: http://dspace.library.uu.nl:8080/handle/1874/7297.

Council of Science Editors:

Heeren BJ. Top quality type error Messages. [Doctoral Dissertation]. Universiteit Utrecht; 2005. Available from: http://dspace.library.uu.nl:8080/handle/1874/7297

27. Heeren, B.J. Top quality type error Messages.

Degree: 2005, University Utrecht

 Flaws in computer software are a fact of life, both in small and large-scale applications. Compilers for modern programming languages accommodate many program analyses for… (more)

Subjects/Keywords: constraints; type inference; type error messages; type systems; directives; domain-specific programming; functional programming; heuristics; compiler construction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heeren, B. J. (2005). Top quality type error Messages. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/7297 ; URN:NBN:NL:UI:10-1874-7297 ; urn:isbn:90-393-4005-6 ; URN:NBN:NL:UI:10-1874-7297 ; http://dspace.library.uu.nl/handle/1874/7297

Chicago Manual of Style (16th Edition):

Heeren, B J. “Top quality type error Messages.” 2005. Doctoral Dissertation, University Utrecht. Accessed August 18, 2019. http://dspace.library.uu.nl/handle/1874/7297 ; URN:NBN:NL:UI:10-1874-7297 ; urn:isbn:90-393-4005-6 ; URN:NBN:NL:UI:10-1874-7297 ; http://dspace.library.uu.nl/handle/1874/7297.

MLA Handbook (7th Edition):

Heeren, B J. “Top quality type error Messages.” 2005. Web. 18 Aug 2019.

Vancouver:

Heeren BJ. Top quality type error Messages. [Internet] [Doctoral dissertation]. University Utrecht; 2005. [cited 2019 Aug 18]. Available from: http://dspace.library.uu.nl/handle/1874/7297 ; URN:NBN:NL:UI:10-1874-7297 ; urn:isbn:90-393-4005-6 ; URN:NBN:NL:UI:10-1874-7297 ; http://dspace.library.uu.nl/handle/1874/7297.

Council of Science Editors:

Heeren BJ. Top quality type error Messages. [Doctoral Dissertation]. University Utrecht; 2005. Available from: http://dspace.library.uu.nl/handle/1874/7297 ; URN:NBN:NL:UI:10-1874-7297 ; urn:isbn:90-393-4005-6 ; URN:NBN:NL:UI:10-1874-7297 ; http://dspace.library.uu.nl/handle/1874/7297


North Carolina State University

28. Carlos, Cohan Sujay. The Elimination of Overheads due to Type Annotations and the Identification of Candidate Refactorings.

Degree: MS, Computer Science, 2002, North Carolina State University

 Refactorings are meaning-preserving transformations of object-oriented programs carried out with the aim of improving their design. Sometimes refactorings accomplish just cosmetic improvements. At other times,… (more)

Subjects/Keywords: type annotations; refactorings; type inference; programming languages; software engineering; type constraints; refactoring tools; identification of refactorings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carlos, C. S. (2002). The Elimination of Overheads due to Type Annotations and the Identification of Candidate Refactorings. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/443

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

Carlos, Cohan Sujay. “The Elimination of Overheads due to Type Annotations and the Identification of Candidate Refactorings.” 2002. Thesis, North Carolina State University. Accessed August 18, 2019. http://www.lib.ncsu.edu/resolver/1840.16/443.

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

MLA Handbook (7th Edition):

Carlos, Cohan Sujay. “The Elimination of Overheads due to Type Annotations and the Identification of Candidate Refactorings.” 2002. Web. 18 Aug 2019.

Vancouver:

Carlos CS. The Elimination of Overheads due to Type Annotations and the Identification of Candidate Refactorings. [Internet] [Thesis]. North Carolina State University; 2002. [cited 2019 Aug 18]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/443.

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

Council of Science Editors:

Carlos CS. The Elimination of Overheads due to Type Annotations and the Identification of Candidate Refactorings. [Thesis]. North Carolina State University; 2002. Available from: http://www.lib.ncsu.edu/resolver/1840.16/443

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


University of Gothenburg / Göteborgs Universitet

29. Gander, Anna Jia. Understanding in Real-Time Communication.

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

 Human communication is profoundly social. In social activities, it is not uncommon that people are understood in many different ways, which may have various consequences… (more)

Subjects/Keywords: Communication; understanding, micro-feedback, meaning repair, intercultural communication, face-to-face (FTF), video-mediated communication (VMC), multimodal communi-cation, activity type, relevance, contextualisation, inference, information sharing, sense-making

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gander, A. J. (2018). Understanding in Real-Time Communication. (Thesis). University of Gothenburg / Göteborgs Universitet. Retrieved from http://hdl.handle.net/2077/56223

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

Gander, Anna Jia. “Understanding in Real-Time Communication.” 2018. Thesis, University of Gothenburg / Göteborgs Universitet. Accessed August 18, 2019. http://hdl.handle.net/2077/56223.

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

MLA Handbook (7th Edition):

Gander, Anna Jia. “Understanding in Real-Time Communication.” 2018. Web. 18 Aug 2019.

Vancouver:

Gander AJ. Understanding in Real-Time Communication. [Internet] [Thesis]. University of Gothenburg / Göteborgs Universitet; 2018. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/2077/56223.

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

Council of Science Editors:

Gander AJ. Understanding in Real-Time Communication. [Thesis]. University of Gothenburg / Göteborgs Universitet; 2018. Available from: http://hdl.handle.net/2077/56223

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

30. Juma, Nahid. Complexity Analysis of Tunable Type Inference for Generic Universe Types.

Degree: 2015, University of Waterloo

 This work studies the computational complexity of a tunable static type inference problem which was introduced in prior research [1]. The problem was assumed to… (more)

Subjects/Keywords: Type Inference; Computational Complexity; Algorithms; Generic Universe Types

…identifying which computational complexity class the tunable type inference problem falls under… …then potentially be used to efficiently solve the tunable type inference problem for other… …the context of type systems. Efficient inference can potentially reduce compilation time… …questions that this thesis attempts to answer as follows: Is the tunable type inference problem… …Work The computational complexity of various other type inference problems has been… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Juma, N. (2015). Complexity Analysis of Tunable Type Inference for Generic Universe Types. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9587

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

Juma, Nahid. “Complexity Analysis of Tunable Type Inference for Generic Universe Types.” 2015. Thesis, University of Waterloo. Accessed August 18, 2019. http://hdl.handle.net/10012/9587.

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

MLA Handbook (7th Edition):

Juma, Nahid. “Complexity Analysis of Tunable Type Inference for Generic Universe Types.” 2015. Web. 18 Aug 2019.

Vancouver:

Juma N. Complexity Analysis of Tunable Type Inference for Generic Universe Types. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10012/9587.

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

Council of Science Editors:

Juma N. Complexity Analysis of Tunable Type Inference for Generic Universe Types. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9587

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

[1] [2]

.