Sciweavers

1763 search results - page 335 / 353
» A Formalization of Polytime Functions
Sort
View
AFP
2004
Springer
105views Formal Methods» more  AFP 2004»
15 years 3 months ago
Epigram: Practical Programming with Dependent Types
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
Conor McBride
66
Voted
AISC
2004
Springer
15 years 3 months ago
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
Bruno Buchberger
88
Voted
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
15 years 3 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
IWPSE
2003
IEEE
15 years 2 months ago
Using Coordination Contracts for Flexible Adaptation to Changing Business Rules
This paper reports on the use of coordination contracts, presented at the previous two IWPSE workshops, in a project for a credit recovery company. We have designed and implemente...
Michel Wermelinger, Georgios Koutsoukos, Richard A...
SSDBM
2003
IEEE
83views Database» more  SSDBM 2003»
15 years 2 months ago
PiQA: An Algebra for Querying Protein Data Sets
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
Sandeep Tata, Jignesh M. Patel