Sciweavers

2148 search results - page 200 / 430
» From process logic to program logic
Sort
View
184
Voted
POPL
2004
ACM
15 years 10 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
ENTCS
2008
97views more  ENTCS 2008»
14 years 10 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic
203
Voted
ICFP
2009
ACM
15 years 11 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
ICCAD
2007
IEEE
139views Hardware» more  ICCAD 2007»
15 years 4 months ago
Using functional independence conditions to optimize the performance of latency-insensitive systems
—In latency-insensitive design shell modules are used to encapsulate system components (pearls) in order to interface them with the given latency-insensitive protocol and dynamic...
Cheng-Hong Li, Luca P. Carloni
87
Voted
SAC
2005
ACM
15 years 3 months ago
Knowledge based approach to semantic composition of teams in an organization
Finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. In this paper we present a Des...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...