Sciweavers

2335 search results - page 104 / 467
» Type Checking Type Classes
Sort
View
POPL
1990
ACM
14 years 1 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
HVC
2005
Springer
183views Hardware» more  HVC 2005»
14 years 2 months ago
Detecting Potential Deadlocks with Static Analysis and Run-Time Monitoring
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when a set of thr...
Rahul Agarwal, Liqiang Wang, Scott D. Stoller
LICS
1987
IEEE
14 years 14 days ago
A Framework for Defining Logics
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus ...
Robert Harper, Furio Honsell, Gordon D. Plotkin
JFP
2002
116views more  JFP 2002»
13 years 8 months ago
Recursive subtyping revealed
Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...
ASIAN
2003
Springer
126views Algorithms» more  ASIAN 2003»
14 years 19 days ago
Information Flow Security for XML Transformations
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
Véronique Benzaken, Marwan Burelle, Giusepp...