Checking Dependent Types Using Compiled Code

Authors:
Dirk Kleeblatt
Affiliations:
Fakultät IV --- Elektrotechnik und Informatik, Technische Universität Berlin,
Venue:
Implementation and Application of Functional Languages
Year:
2008

Citing 8
Cited 0

An abstract machine for Lambda-terms normalization

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
An algorithm for type-checking dependent types

Science of Computer Programming - Special issue on mathematics of program construction
Type-directed partial evaluation

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A compiled implementation of strong reduction

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Harpy: run-time code generation in haskell

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has drawbacks. We show, how at this stage compiled code can be used for a language with lazy evaluation.