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:(algebraic data types). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Minnesota

1. Pham, Hung Tuan. Verification of Recursive Data Types using abstractions.

Degree: PhD, Computer Science, 2014, University of Minnesota

 Reasoning about functions that operate over algebraic data types is an important problem for a large variety of applications. One application of particular interest is… (more)

Subjects/Keywords: Algebraic data types; Catamorphisms; Decision procedure; SMT solvers; Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pham, H. T. (2014). Verification of Recursive Data Types using abstractions. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/163020

Chicago Manual of Style (16th Edition):

Pham, Hung Tuan. “Verification of Recursive Data Types using abstractions.” 2014. Doctoral Dissertation, University of Minnesota. Accessed January 26, 2021. http://hdl.handle.net/11299/163020.

MLA Handbook (7th Edition):

Pham, Hung Tuan. “Verification of Recursive Data Types using abstractions.” 2014. Web. 26 Jan 2021.

Vancouver:

Pham HT. Verification of Recursive Data Types using abstractions. [Internet] [Doctoral dissertation]. University of Minnesota; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/11299/163020.

Council of Science Editors:

Pham HT. Verification of Recursive Data Types using abstractions. [Doctoral Dissertation]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/163020


Brno University of Technology

2. Novák, Samuel Matyáš. Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++.

Degree: 2020, Brno University of Technology

 This work concerns the implementation of a sum data type in C++. First, custom abstractions to handle sequences of values and types are proposed, which… (more)

Subjects/Keywords: šablonové metaprogramování; generické programování; generování kódu při kompilaci; datové struktury; součtové datové typy; algebraické datové typy; polymorfismus; template metaprogramming; generic programming; compile-time code generation; data structures; sum data types; algebraic data types; polymorphism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Novák, S. M. (2020). Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/191876

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

Novák, Samuel Matyáš. “Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++.” 2020. Thesis, Brno University of Technology. Accessed January 26, 2021. http://hdl.handle.net/11012/191876.

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

MLA Handbook (7th Edition):

Novák, Samuel Matyáš. “Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++.” 2020. Web. 26 Jan 2021.

Vancouver:

Novák SM. Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/11012/191876.

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

Council of Science Editors:

Novák SM. Implementace součtového datového typu v C++: Implementation of Sum Data Type in C++. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/191876

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


Portland State University

3. Lin, Chuan-kai. Practical Type Inference for the GADT Type System.

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

  Generalized algebraic data types (GADTs) are a type system extension to algebraic data types that allows the type of an algebraic data value to… (more)

Subjects/Keywords: Functional programming languages; Generalized algebraic data types (Computer science); Data structures (Computer science); Algebra  – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, C. (2010). Practical Type Inference for the GADT Type System. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/367

Chicago Manual of Style (16th Edition):

Lin, Chuan-kai. “Practical Type Inference for the GADT Type System.” 2010. Doctoral Dissertation, Portland State University. Accessed January 26, 2021. https://pdxscholar.library.pdx.edu/open_access_etds/367.

MLA Handbook (7th Edition):

Lin, Chuan-kai. “Practical Type Inference for the GADT Type System.” 2010. Web. 26 Jan 2021.

Vancouver:

Lin C. Practical Type Inference for the GADT Type System. [Internet] [Doctoral dissertation]. Portland State University; 2010. [cited 2021 Jan 26]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/367.

Council of Science Editors:

Lin C. Practical Type Inference for the GADT Type System. [Doctoral Dissertation]. Portland State University; 2010. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/367

4. Malakhovski, Ian. Sur le pouvoir expressif des structures applicatives et monadiques indexées : On the expressive power of indexed applicative and monadic structures.

Degree: Docteur es, Informatique et télécommunications, 2019, Université Toulouse III – Paul Sabatier

Il est bien connu que des constructions théoriques très simples telles que les structures Either (équivalent type théorique de l'opérateur logique "ou"), State (représentant des… (more)

Subjects/Keywords: Foncteurs applicatifs; Monades; Monades indexées; Type algébrique de données; Métaprogrammation; Processeur basé sur la pile; Combinateurs d'analyseurs syntaxiques; Logique; Théorie des catégories; Applicative functors; Indexed monads; Algebraic data types; Metaprogramming; Stack machines; Parser combinators; Logic; Category theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malakhovski, I. (2019). Sur le pouvoir expressif des structures applicatives et monadiques indexées : On the expressive power of indexed applicative and monadic structures. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2019TOU30118

Chicago Manual of Style (16th Edition):

Malakhovski, Ian. “Sur le pouvoir expressif des structures applicatives et monadiques indexées : On the expressive power of indexed applicative and monadic structures.” 2019. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed January 26, 2021. http://www.theses.fr/2019TOU30118.

MLA Handbook (7th Edition):

Malakhovski, Ian. “Sur le pouvoir expressif des structures applicatives et monadiques indexées : On the expressive power of indexed applicative and monadic structures.” 2019. Web. 26 Jan 2021.

Vancouver:

Malakhovski I. Sur le pouvoir expressif des structures applicatives et monadiques indexées : On the expressive power of indexed applicative and monadic structures. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2019. [cited 2021 Jan 26]. Available from: http://www.theses.fr/2019TOU30118.

Council of Science Editors:

Malakhovski I. Sur le pouvoir expressif des structures applicatives et monadiques indexées : On the expressive power of indexed applicative and monadic structures. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2019. Available from: http://www.theses.fr/2019TOU30118

.