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 +publisher:"McMaster University" +contributor:("Kahl, Wolfram"). Showing records 1 – 10 of 10 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


McMaster University

1. Perna, Natalie. (Re-)Creating sharing in Agda's GHC backend.

Degree: MSc, 2017, McMaster University

Agda is a dependently-typed programming language and theorem prover, supporting proof construction in a functional programming style. Due to its incredibly flexible concrete syntax and… (more)

Subjects/Keywords: Compiler optimizations; Functional programming; Dependent types; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perna, N. (2017). (Re-)Creating sharing in Agda's GHC backend. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/22177

Chicago Manual of Style (16th Edition):

Perna, Natalie. “(Re-)Creating sharing in Agda's GHC backend.” 2017. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/22177.

MLA Handbook (7th Edition):

Perna, Natalie. “(Re-)Creating sharing in Agda's GHC backend.” 2017. Web. 18 Apr 2021.

Vancouver:

Perna N. (Re-)Creating sharing in Agda's GHC backend. [Internet] [Masters thesis]. McMaster University; 2017. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/22177.

Council of Science Editors:

Perna N. (Re-)Creating sharing in Agda's GHC backend. [Masters Thesis]. McMaster University; 2017. Available from: http://hdl.handle.net/11375/22177


McMaster University

2. Zhao, Yuhang. A Machine-checked Categorial Formalisation of Term Graph Rewriting with Semantics Preservation.

Degree: PhD, 2018, McMaster University

Term graph rewriting is important as "conceptual implementation" of the execution of functional programs, and of data-flow optimisations in compilers. Since term graphs were introduced… (more)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Y. (2018). A Machine-checked Categorial Formalisation of Term Graph Rewriting with Semantics Preservation. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/24072

Chicago Manual of Style (16th Edition):

Zhao, Yuhang. “A Machine-checked Categorial Formalisation of Term Graph Rewriting with Semantics Preservation.” 2018. Doctoral Dissertation, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/24072.

MLA Handbook (7th Edition):

Zhao, Yuhang. “A Machine-checked Categorial Formalisation of Term Graph Rewriting with Semantics Preservation.” 2018. Web. 18 Apr 2021.

Vancouver:

Zhao Y. A Machine-checked Categorial Formalisation of Term Graph Rewriting with Semantics Preservation. [Internet] [Doctoral dissertation]. McMaster University; 2018. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/24072.

Council of Science Editors:

Zhao Y. A Machine-checked Categorial Formalisation of Term Graph Rewriting with Semantics Preservation. [Doctoral Dissertation]. McMaster University; 2018. Available from: http://hdl.handle.net/11375/24072


McMaster University

3. Al-hassy, Musa. A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets.

Degree: MSc, 2015, McMaster University

Using the the dependently-typed programming language Agda, we formalise orders, with attention to the theory of Galois Connections, and showcase it by formalising a few… (more)

Subjects/Keywords: relation algebra; ordered category; converse; order; galois connection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-hassy, M. (2015). A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/17276

Chicago Manual of Style (16th Edition):

Al-hassy, Musa. “A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets.” 2015. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/17276.

MLA Handbook (7th Edition):

Al-hassy, Musa. “A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets.” 2015. Web. 18 Apr 2021.

Vancouver:

Al-hassy M. A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets. [Internet] [Masters thesis]. McMaster University; 2015. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/17276.

Council of Science Editors:

Al-hassy M. A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets. [Masters Thesis]. McMaster University; 2015. Available from: http://hdl.handle.net/11375/17276


McMaster University

4. Hossain, Md Nour. INTRODUCING ASPECTS INTO SOFTWARE ARCHITECTURES BY GRAPH TRANSFORMATION.

Degree: PhD, 2018, McMaster University

While aspect-oriented programming (AOP) addresses the introduction of “aspects” at the code level, we argue that addressing this at the level of software architecture is… (more)

Subjects/Keywords: ASPECT INTRODUCTION; DIAGRAM TRANSFORMATION; GRAPH TRANSFORMATION; SOFTWARE ARCHITECTURE

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. N. (2018). INTRODUCING ASPECTS INTO SOFTWARE ARCHITECTURES BY GRAPH TRANSFORMATION. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/24056

Chicago Manual of Style (16th Edition):

Hossain, Md Nour. “INTRODUCING ASPECTS INTO SOFTWARE ARCHITECTURES BY GRAPH TRANSFORMATION.” 2018. Doctoral Dissertation, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/24056.

MLA Handbook (7th Edition):

Hossain, Md Nour. “INTRODUCING ASPECTS INTO SOFTWARE ARCHITECTURES BY GRAPH TRANSFORMATION.” 2018. Web. 18 Apr 2021.

Vancouver:

Hossain MN. INTRODUCING ASPECTS INTO SOFTWARE ARCHITECTURES BY GRAPH TRANSFORMATION. [Internet] [Doctoral dissertation]. McMaster University; 2018. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/24056.

Council of Science Editors:

Hossain MN. INTRODUCING ASPECTS INTO SOFTWARE ARCHITECTURES BY GRAPH TRANSFORMATION. [Doctoral Dissertation]. McMaster University; 2018. Available from: http://hdl.handle.net/11375/24056


McMaster University

5. Dobrogost, Michal. Verifying Permutation Rewritable Hazard Free Loops.

Degree: MSc, 2011, McMaster University

We present an extension to the language of Atomic Verifiable Operation (AVOp) streams to allow the expression of loops which are rewritable via an… (more)

Subjects/Keywords: parallelism multicore verification permutation high-performance computing; Numerical Analysis and Scientific Computing; Numerical Analysis and Scientific Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dobrogost, M. (2011). Verifying Permutation Rewritable Hazard Free Loops. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/10755

Chicago Manual of Style (16th Edition):

Dobrogost, Michal. “Verifying Permutation Rewritable Hazard Free Loops.” 2011. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/10755.

MLA Handbook (7th Edition):

Dobrogost, Michal. “Verifying Permutation Rewritable Hazard Free Loops.” 2011. Web. 18 Apr 2021.

Vancouver:

Dobrogost M. Verifying Permutation Rewritable Hazard Free Loops. [Internet] [Masters thesis]. McMaster University; 2011. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/10755.

Council of Science Editors:

Dobrogost M. Verifying Permutation Rewritable Hazard Free Loops. [Masters Thesis]. McMaster University; 2011. Available from: http://hdl.handle.net/11375/10755


McMaster University

6. Moghadas, Maryam. Type-Safety for Inverse Imaging Problems.

Degree: MSc, 2012, McMaster University

This thesis gives a partial answer to the question: “Can type systems detect modeling errors in scientific computing, particularly for inverse problems derived from… (more)

Subjects/Keywords: type-safety; Inverse Imaging Problem; Type Level Programming; Haskell; Regularization; formalization; Numerical Analysis and Scientific Computing; Programming Languages and Compilers; Numerical Analysis and Scientific Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moghadas, M. (2012). Type-Safety for Inverse Imaging Problems. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/12487

Chicago Manual of Style (16th Edition):

Moghadas, Maryam. “Type-Safety for Inverse Imaging Problems.” 2012. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/12487.

MLA Handbook (7th Edition):

Moghadas, Maryam. “Type-Safety for Inverse Imaging Problems.” 2012. Web. 18 Apr 2021.

Vancouver:

Moghadas M. Type-Safety for Inverse Imaging Problems. [Internet] [Masters thesis]. McMaster University; 2012. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/12487.

Council of Science Editors:

Moghadas M. Type-Safety for Inverse Imaging Problems. [Masters Thesis]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12487


McMaster University

7. Bouman, Tanya. Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography.

Degree: MSc, 2021, McMaster University

Commercial applications, including Blockchain, require large numbers of cryptographic signing and verification operations, increasingly using Elliptic Curve Cryptography. This uses a group operation (called point… (more)

Subjects/Keywords: cryptography; parallel computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bouman, T. (2021). Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/26191

Chicago Manual of Style (16th Edition):

Bouman, Tanya. “Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography.” 2021. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/26191.

MLA Handbook (7th Edition):

Bouman, Tanya. “Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography.” 2021. Web. 18 Apr 2021.

Vancouver:

Bouman T. Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography. [Internet] [Masters thesis]. McMaster University; 2021. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/26191.

Council of Science Editors:

Bouman T. Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography. [Masters Thesis]. McMaster University; 2021. Available from: http://hdl.handle.net/11375/26191


McMaster University

8. Sepehr, Sepandar. Adding Nested Headers and a Proper Gtk-Based GUI to The Haskell Table Tools.

Degree: MS, 2010, McMaster University

Specification of Large Scale Systems like Safety Critical Softwares is an important yet frequently tedious process. The requirement analysts often face a large number… (more)

Subjects/Keywords: Computer Sciences; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sepehr, S. (2010). Adding Nested Headers and a Proper Gtk-Based GUI to The Haskell Table Tools. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/9275

Chicago Manual of Style (16th Edition):

Sepehr, Sepandar. “Adding Nested Headers and a Proper Gtk-Based GUI to The Haskell Table Tools.” 2010. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/9275.

MLA Handbook (7th Edition):

Sepehr, Sepandar. “Adding Nested Headers and a Proper Gtk-Based GUI to The Haskell Table Tools.” 2010. Web. 18 Apr 2021.

Vancouver:

Sepehr S. Adding Nested Headers and a Proper Gtk-Based GUI to The Haskell Table Tools. [Internet] [Masters thesis]. McMaster University; 2010. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/9275.

Council of Science Editors:

Sepehr S. Adding Nested Headers and a Proper Gtk-Based GUI to The Haskell Table Tools. [Masters Thesis]. McMaster University; 2010. Available from: http://hdl.handle.net/11375/9275


McMaster University

9. Everets, Kevin. Assembly Language Representation and Graph Generation in a Pure Functional Programming Language.

Degree: MSc, 2005, McMaster University

In industry many legacy systems exist which run mission or safety critical code which do not have adequate requirements documentation. This thesis demonstrates how… (more)

Subjects/Keywords: Computing and Software; Computer Engineering; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Everets, K. (2005). Assembly Language Representation and Graph Generation in a Pure Functional Programming Language. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/13083

Chicago Manual of Style (16th Edition):

Everets, Kevin. “Assembly Language Representation and Graph Generation in a Pure Functional Programming Language.” 2005. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/13083.

MLA Handbook (7th Edition):

Everets, Kevin. “Assembly Language Representation and Graph Generation in a Pure Functional Programming Language.” 2005. Web. 18 Apr 2021.

Vancouver:

Everets K. Assembly Language Representation and Graph Generation in a Pure Functional Programming Language. [Internet] [Masters thesis]. McMaster University; 2005. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/13083.

Council of Science Editors:

Everets K. Assembly Language Representation and Graph Generation in a Pure Functional Programming Language. [Masters Thesis]. McMaster University; 2005. Available from: http://hdl.handle.net/11375/13083


McMaster University

10. Thaller, Wolfgang. Explicitly Staged Software Pipelining.

Degree: MSc, 2006, McMaster University

Software Pipelining is a method of instruction scheduling where loops are scheduled more efficiently by executing operations from more than one iteration of the… (more)

Subjects/Keywords: software pipelining; optimal software; pipeline schedule; computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thaller, W. (2006). Explicitly Staged Software Pipelining. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/20357

Chicago Manual of Style (16th Edition):

Thaller, Wolfgang. “Explicitly Staged Software Pipelining.” 2006. Masters Thesis, McMaster University. Accessed April 18, 2021. http://hdl.handle.net/11375/20357.

MLA Handbook (7th Edition):

Thaller, Wolfgang. “Explicitly Staged Software Pipelining.” 2006. Web. 18 Apr 2021.

Vancouver:

Thaller W. Explicitly Staged Software Pipelining. [Internet] [Masters thesis]. McMaster University; 2006. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/11375/20357.

Council of Science Editors:

Thaller W. Explicitly Staged Software Pipelining. [Masters Thesis]. McMaster University; 2006. Available from: http://hdl.handle.net/11375/20357

.