Sciweavers

10666 search results - page 1861 / 2134
» Quantum programming languages
Sort
View
BIRTHDAY
2010
Springer
15 years 4 months ago
Model Checking Programmable Router Configurations
Programmable networks offer the ability to customize router behaviour at run time, thus providing new levels of flexibility for network administrators. We have developed a program...
Luca Zanolin, Cecilia Mascolo, Wolfgang Emmerich
APAL
2008
90views more  APAL 2008»
15 years 4 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 4 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 4 months ago
Using ATL to define advanced and flexible constraint model transformations
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...
Raphaël Chenouard, Laurent Granvilliers, Rica...
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 4 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
« Prev « First page 1861 / 2134 Last » Next »