Sciweavers

156 search results - page 9 / 32
» Interactive Programs in Dependent Type Theory
Sort
View
ELP
1991
13 years 11 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning
ICFP
2003
ACM
14 years 7 months ago
MLF: raising ML to the power of system F
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
Didier Le Botlan, Didier Rémy
ICFP
1996
ACM
13 years 11 months ago
Inductive, Coinductive, and Pointed Types
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
Brian T. Howard
SAC
2009
ACM
14 years 2 months ago
Dynamic planning and weaving of dependability concerns for self-adaptive ubiquitous services
Ubiquitous computing and service-oriented computing enable the development of a new trend of applications that can opportunely interact with services discovered in the surrounding...
Romain Rouvoy, Frank Eliassen, Mikaël Beauvoi...
FP
1991
95views Formal Methods» more  FP 1991»
13 years 11 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans