Sciweavers

1021 search results - page 33 / 205
» Pure Subtype Systems
Sort
View
ICSM
1999
IEEE
14 years 1 days ago
Recovering High-Level Views of Object-Oriented Applications from Static and Dynamic Information
Recovering architectural documentation from code is crucial to maintaining and reengineering software systems. Reverse engineering and program understanding approaches are often l...
Tamar Richner, Stéphane Ducasse
ENTCS
2002
129views more  ENTCS 2002»
13 years 7 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
LISP
1998
57views more  LISP 1998»
13 years 7 months ago
A Generalization of Jumps and Labels
This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional la...
Peter J. Landin
HASKELL
2008
ACM
13 years 8 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay