Sciweavers

1194 search results - page 104 / 239
» A Calculus for Predicative Programming
Sort
View
134
Voted
ENTCS
2008
170views more  ENTCS 2008»
15 years 2 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
129
Voted
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
15 years 7 months ago
Evolving stochastic processes using feature tests and genetic programming
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
Brian J. Ross, Janine H. Imada
109
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 2 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
124
Voted
LFP
1992
153views more  LFP 1992»
15 years 3 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
89
Voted
CTCS
1989
Springer
15 years 6 months ago
A Category-theoretic Account of Program Modules
The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions i...
Eugenio Moggi