2777 search results - page 253 / 556 » Example centric programming |
163
click to vote
CALCO
2009
Springer
16 years 28 days ago
2009
Springer
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...
149
click to vote
CSL
2009
Springer
16 years 28 days ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
158
click to vote
ER
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. Vulnerabilities are weaknesses in the requirements, design, and implementation, which attackers exploit to compromise the system. This paper proposes a vulnerability-cent...
187
click to vote
ICMT
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
144
Voted
ISSAC
2007
Springer
16 years 15 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...