Sciweavers

4757 search results - page 192 / 952
» Monads for Functional Programming
Sort
View
ICFP
1998
ACM
15 years 10 months ago
Fold and Unfold for Program Semantics
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
Graham Hutton
DAGSTUHL
2007
15 years 8 months ago
Classical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
Farid M. Ablayev
IASSE
2003
15 years 7 months ago
Stratified Programming Integrated Development Environment (SPIDER)
This paper describes the functionality required for a development environment that supports stratified programming (SP), a novel software development method that we have proposed ...
Sergiu M. Dascalu, Adrian Pasculescu, Josh Wooleve...
CIE
2010
Springer
15 years 4 months ago
Proofs, Programs, Processes
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Ulrich Berger, Monika Seisenberger
SAMOS
2004
Springer
15 years 11 months ago
with Wide Functional Units
— Architectural resources and program recurrences are the main limitations to the amount of Instruction-Level Parallelism (ILP) exploitable from loops, the most time-consuming pa...
Miquel Pericàs, Eduard Ayguadé, Javi...