Sciweavers

1805 search results - page 221 / 361
» Functional programming with structured graphs
Sort
View
POPL
2010
ACM
15 years 11 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
VL
2009
IEEE
150views Visual Languages» more  VL 2009»
15 years 8 months ago
Discovery-based edit assistance for spreadsheets
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...
Jácome Cunha, João Saraiva, Joost Vi...
ENTCS
2006
89views more  ENTCS 2006»
15 years 1 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
CALCO
2009
Springer
172views Mathematics» more  CALCO 2009»
15 years 8 months ago
Coalgebraic Components in a Many-Sorted Microcosm
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...
Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokol...
JCB
2000
129views more  JCB 2000»
15 years 1 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler