Sciweavers

18429 search results - page 144 / 3686
» Typing dynamic typing
Sort
View
112
Voted
ENTCS
2008
97views more  ENTCS 2008»
15 years 5 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic
152
Voted
ENTCS
2006
118views more  ENTCS 2006»
15 years 5 months ago
An Operational Domain-theoretic Treatment of Recursive Types
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
Weng Kin Ho
127
Voted
JFP
2006
103views more  JFP 2006»
15 years 4 months ago
Phantom types and subtyping
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
Matthew Fluet, Riccardo Pucella
ENTCS
2007
82views more  ENTCS 2007»
15 years 4 months ago
Syntactic Logical Relations for Polymorphic and Recursive Types
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in ...
Karl Crary, Robert Harper
ENTCS
2007
92views more  ENTCS 2007»
15 years 4 months ago
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
Clemens Grabmayer