Results 1 -
2 of
2
Interactive programs and weakly final coalgebras (extended version
- Dependently typed programming, number 04381 in Dagstuhl Seminar Proceedings, 2004. Available via http://drops.dagstuhl.de/opus
"... GR/S30450/01. 2 A. Setzer, P. Hancock 1 Introduction According to Martin-L"of [19]: "... I do not think that the search for logically ever more satisfac-tory high level programming languages can stop short of anything but ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
GR/S30450/01. 2 A. Setzer, P. Hancock 1 Introduction According to Martin-L"of [19]: "... I do not think that the search for logically ever more satisfac-tory high level programming languages can stop short of anything but
Object-Oriented Programming in Dependent Type Theory
"... Abstract: We introduce basic concepts from object-oriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interfaces, and the interaction between a fixed number of objects, including self-referential method calls. We introd ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract: We introduce basic concepts from object-oriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interfaces, and the interaction between a fixed number of objects, including self-referential method calls. We introduce a monad like syntax for developing objects in dependent type theory. 1.1
