Sciweavers

303 search results - page 18 / 61
» Theory Interpretation in Simple Type Theory
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
FMCO
2003
Springer
123views Formal Methods» more  FMCO 2003»
14 years 22 days ago
Machine Function Based Control Code Algebras
Abstract. Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]....
Jan A. Bergstra
BIRTHDAY
2004
Springer
14 years 28 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
POPL
2006
ACM
14 years 7 months ago
The next 700 data description languages
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
Kathleen Fisher, Yitzhak Mandelbaum, David Walker
TPHOL
2007
IEEE
14 years 1 months ago
Mizar's Soft Type System
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...
Freek Wiedijk