A kernel language for abstract data types and modules.
Proc. of the international symposium on Semantics of data types
The typechecking of programs with implicit type structure.
Proc. of the international symposium on Semantics of data types
On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Three approaches to type structure
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
CommonLoops: merging Lisp and object-oriented programming
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
Oaklisp: an object-oriented scheme with first class types
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
Finding the source of type errors
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reflection and semantics in LISP
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A types-as-sets semantics for milner-style polymorphism
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
EKL - an interactive proof checker user''s reference manual
EKL - an interactive proof checker user''s reference manual
Programming languages as operating systems (or revenge of the son of the lisp machine)
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Typed self-interpretation by pattern matching
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
A functional language is introduced, whose type system is defined by its meta-circular interpreter. The functional language is an extension of @l-calculus augmented with the rule for conditional terms that allows the condition of a conditional term to be used for reducing its branches. This makes it possible to deduce the well-typing of terms with dependent types including the meta-circular interpreter. In the type system built by the interpreter, types are represented by ordinary terms, which reflects the recent object-oriented programming languages, in which classes are manipulated as ordinary objects. The paper first discusses the untyped system of the functional language and its consistency, then develops the representation of types and the representation of terms, and define a meta-circular interpreter, by which the well-typing of the language is defined and also discusses the extensibility of the interpreter and the type system.