Sciweavers

632 search results - page 72 / 127
» Combining programming with theorem proving
Sort
View
127
Voted
POPL
2010
ACM
16 years 1 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
144
Voted
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 8 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
159
Voted
ICFP
1999
ACM
15 years 8 months ago
Specialization of Inductively Sequential Functional Logic Programs
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
María Alpuente, Michael Hanus, Salvador Luc...
237
Voted
POPL
2008
ACM
16 years 4 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
213
Voted
POPL
2005
ACM
16 years 4 months ago
Communicating quantum processes
We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication ...
Simon J. Gay, Rajagopal Nagarajan