Sciweavers

4959 search results - page 7 / 992
» Imperative Functional Programming
Sort
View
113
Voted
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 3 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
128
Voted
ICFP
2003
ACM
16 years 3 months ago
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax
Alberto Ciaffaglione, Luigi Liquori, Marino Micula...
141
Voted
ENTCS
2007
103views more  ENTCS 2007»
15 years 3 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
122
Voted
POPL
1991
ACM
15 years 7 months ago
Polymorphic Type Inference and Assignment
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
Xavier Leroy, Pierre Weis
141
Voted
PLDI
1993
ACM
15 years 7 months ago
Abstract Debugging of Higher-Order Imperative Languages
François Bourdoncle