Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 61 for “"dependent types"”.
-
Dependency Tracking and Dependent Types
… how computations depend on their inputs. Dependent types, on the other hand, allow static types to depend on and be determined by program values. This dissertation describes my work on designing expressive dependently typed systems where useful features such as relevance tracking and …
-
Type inference, Haskell and dependent types
… and elaboration for languages that combine dependent type theory and functional programming. Languages such as modern Haskell have very expressive type systems, allowing the programmer a great deal of freedom. These require advanced type inference and unification algorithms to reconstruct …
-
In search of effectful dependent types
… Logical frameworks rely on predicates, or dependent types, to express detailed logical properties about entities. According to the Curry-Howard correspondence, programming languages and logical frameworks should be very closely related. However, a language that has both good support for …
-
Toatie : functional hardware description with dependent types
… verification methodology via the combination of dependent types and automatic synthesis of user-defined data types. Given precise enough types for synthesisable data, this environment can be used to develop circuit families with full functional verification in a correct-by-construction fashion. …
-
Sized dependent types via extensional type theory
Many contemporary proof assistants based on dependent type theories such as Coq and Agda are founded on the types-as-propositions paradigm where type checking a program corresponds to verifying a proof of some proposition in a higher-order predicate logic. To ensure decidability of type checking …
-
Dependent Types In Haskell: Theory And Practice
… of these features---generalized algebraic datatypes (GADTs), type families, kind polymorphism, and promoted datatypes---have brought Haskell to the doorstep of dependent types. Many dependently typed programs can even currently be encoded, but often the constructions are painful. In this …
-
ANF preserves dependent types up to extensional equality
A growing number of programmers use dependently typed languages such as Coq to machine-verify important properties of high-assurance software. However, existing compilers for these languages provide no guarantees after compiling, nor when linking after compilation. Type-preserving compilers …
-
A cosmology of datatypes : reusability and dependent types
This dissertation defends the idea of a closed dependent type theory whose inductive types are encoded in a universe. Each inductive definition arises by interpreting its description - itself a firstclass citizen in the type theory. Datatype-generic programming thus becomes ordinary programming. …
-
Singly typed actors in Agda - An approach to distributed programming with dependent types
… that subtyping solves the problem of wide actor types when sending messages. However, the use of a single inbox per actor remains problematic when receiving messages, especially in the context of call-response patterns. Our emulation of local channels alleviates the problem of wide actor types, …
-
Dependent Types as a Medium for Domain Modelling: Case Studies and Lessons from Agda
Dependent types are commonly presented as a foundation for program verification, enabling precise specifications and machine-checked proofs of correctness. In practice, however, much of the intellectual effort in formal methods is spent not on proving properties of programs, but on modelling: …
-
On the design of a gradual dependently typed language for programming
Dependently typed programming languages provide a way to write programs, specifications, and correctness proofs using a single language. If a dependent type checker accepts a program, the programmer can be assured that it behaves according to the specification given in its types. However, …
-
A Path to DOT: Formalizing Scala with Dependent Object Types
… to extend with more features. I build on the Dependent Object Types (DOT) calculus that formalizes path-dependent types. My contributions are i) a generalization of DOT with types that depend on paths of arbitrary length, ii) a simple, extensible type-safety proof for DOT, and iii) an …
-
Using Intrinsically-Typed Definitional Interpreters to Verify Compiler Optimizations in a Monadic Intermediate Language
… one, given the potential for error introduction. Dependent types allow us to prove that properties about our programs are correct, as well as to design data types and interpreters in such a way that they are correct-by-construction. In this thesis, we explore the use of dependent types and …
-
Implementing and Optimizing a Simple, Dependently-Typed Language
… programming language LambdaPi, which includes dependent types. The compiler is written in Haskell and uses LLVM, a framework for building optimizing compiler backends. It can compile the complete standard library provided by LambdaPi’s authors into native machine code. It is not much of an …
-
On the syntax and the semantics of propositional dependent type theories
… to contribute to the theory of propositional dependent type theories, also known in the literature as weak, objective, and axiomatic dependent type theories, via syntactic and semantic, specifically category theoretic, approaches. Propositional theories of dependent types are dependent type …
-
DEPENDENCY AND LINEARITY ANALYSES IN PURE TYPE SYSTEMS
… with respect to simple and polymorphic types. However, with respect to dependent types, the two analyses have not been explored much. This dissertation explores how dependent types interact with dependency and linearity analyses. More precisely, in this dissertation, we extend dependency …
-
A Type System With Containers
… they can bring. To support containment, a dependent type system is developed to enforce container rules. We add the notion of a container label to our types to indicate the container of the referred object. Around this type system we develop a language enhanced with container syntax. We use …
-
A Dependently Typed Language with Nontermination
We propose a full-spectrum dependently typed programming language, Zombie, which supports general recursion natively. The Zombie implementation is an elaborating typechecker. We prove type saftey for a large subset of the Zombie core language, including features such as computational irrelevance, …
-
Type Dependent Policy Language
… disclosure. To accomplish this, we realize two independent implementation of the privacy and selection policies using indexed types and subset types. In using indexed types, the policy check is accomplished by indexing the term grammar with the type of evidence the term produces. The statically …
-
(Re-)Creating sharing in Agda's GHC backend
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 support for Unicode identifiers, Agda can be used to construct elegant and expressive proofs in a format that is …
Page 1 of 4