Sciweavers

271 search results - page 22 / 55
» Self type constructors
Sort
View
CADE
2001
Springer
14 years 7 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
APLAS
2005
ACM
14 years 1 months ago
Lightweight Family Polymorphism
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...
Atsushi Igarashi, Chieri Saito, Mirko Viroli
IEAAIE
2005
Springer
14 years 1 months ago
A SOM Based Approach for Visualization of GSM Network Performance Data
In this paper, a neural network based approach to visualize performance data of a GSM network is presented. The proposed approach consists of several steps. First, a suitable propo...
Pasi Lehtimäki, Kimmo Raivio
SEKE
2004
Springer
14 years 25 days ago
Black- and White-Box Self-testing COTS Components
Development of a software system from existing components can surely have various benefits, but can also entail a series of problems. One type of problems is caused by a limited ...
Sami Beydeda, Volker Gruhn
JOC
2008
86views more  JOC 2008»
13 years 7 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell