Sciweavers

640 search results - page 47 / 128
» Logical types for untyped languages
Sort
View
POPL
2007
ACM
14 years 9 months ago
Modular type classes
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
Derek Dreyer, Robert Harper, Manuel M. T. Chakrava...
AOSD
2007
ACM
14 years 1 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
CADE
1999
Springer
14 years 1 months ago
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
Abstract. Twelf is a meta-logical framework for the specification, implementation, and meta-theory of deductive systems from the theory of programming languages and logics. It rel...
Frank Pfenning, Carsten Schürmann
JLP
2008
134views more  JLP 2008»
13 years 9 months ago
Backwards type analysis of asynchronous method calls
Asynchronous method calls have been proposed to better integrate object orientation with distribution. In the Creol language, asynchronous method calls are combined with so-called...
Einar Broch Johnsen, Ingrid Chieh Yu
APLAS
2004
ACM
14 years 2 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi