Sökning: "Type definitions"
Visar resultat 1 - 5 av 67 avhandlingar innehållade orden Type definitions.
1. Descriptive Types for XML Query Language Xcerpt
Sammanfattning : The thesis presents a type system for a substantial fragment of XML query language Xcerpt. The system is descriptive; the types associated with Xcerpt constructs are sets of data terms and approximate the semantics of the constructs.A formalism of Type Definitions, related to XML schema languages, is adopted to specify such sets. LÄS MER
2. Conservative Definitions for Higher-order Logic with Ad-hoc Overloading
Sammanfattning : With an ever growing dependency on computer systems, the need to guarantee their correct behaviour increases. Mathematically rigorous techniques like formal verification offer a way to derive a system's mathematical properties for example with the help of a theorem prover. LÄS MER
3. Localic Categories of Models and Categorical Aspects of Intuitionistic Ramified Type Theory
Sammanfattning : This thesis contains three papers, all in the general area of categorical logic, together with an introductory part with some minor results and proofs of known results which does not appear to be (easily) available in the literature.In Papers I and II we investigate the formal system Intuitionistic Ramified Type Theory (IRTT), introduced by Erik Palmgren, as an approach to predicative topos theory. LÄS MER
4. General Recursion in Type Theory
Sammanfattning : This thesis deals with the use of constructive type theory as a programming language. In particular, it presents a method to translate general recursive functional programs into their type-theoretic equivalents. A key notion in functional programming is recursion, which allows that the object being defined refers to itself. LÄS MER
5. On Induction, Coinduction and Equality in Martin-Löf and Homotopy Type Theory
Sammanfattning : Martin Löf Type Theory, having put computation at the center of logical reasoning, has been shown to be an effective foundation for proof assistants, with applications both in computer science and constructive mathematics. One ambition though is for MLTT to also double as a practical general purpose programming language. LÄS MER