Sciweavers

640 search results - page 33 / 128
» Logical types for untyped languages
Sort
View
ICFP
2010
ACM
13 years 8 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
PADL
2004
Springer
14 years 1 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
TIC
2000
Springer
110views System Software» more  TIC 2000»
13 years 11 months ago
Safe and Flexible Dynamic Linking of Native Code
Abstract. We present the design and implementation of the first complete framework for flexible and safe dynamic linking of native code. Our approach extends Typed Assembly Languag...
Michael W. Hicks, Stephanie Weirich, Karl Crary
ICLP
2011
Springer
12 years 11 months ago
Implementation of Axiomatic Language
This report summarizes a PhD research effort to implement a type of logic programming language called “axiomatic language”. Axiomatic language is intended as a specification...
Walter W. Wilson
SAC
2009
ACM
14 years 2 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi