Sciweavers

2646 search results - page 125 / 530
» Local Type Inference
Sort
View
197
Voted
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 17 days ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
135
Voted
ICFP
2005
ACM
16 years 2 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
137
Voted
FPCA
1989
15 years 6 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
99
Voted
AAAI
1998
15 years 4 months ago
On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...
Berthe Y. Choueiry, Guevara Noubir
136
Voted
NETWORK
2007
167views more  NETWORK 2007»
15 years 2 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao