Difference between revisions of "Publications/regisgianas.03.poosc"
From LRDE
Line 10: | Line 10: | ||
| series = John von Neumann Institute for Computing (NIC) |
| series = John von Neumann Institute for Computing (NIC) |
||
| address = Darmstadt, Germany |
| address = Darmstadt, Germany |
||
− | | |
+ | | lrdeprojects = Vaucanson |
− | | urllrde = 200307-Poosc |
||
| abstract = Vaucanson is a C++ generic library for weighted finite state machine manipulation. For the sake of generality, FSM are defined using algebraic structures such as alphabet (for the letters), free monoid (for the words), semiring (for the weights) and series (mapping from words to weights). As usual, what is at stake is to maintain efficiency while providing a high-level layer for the writing of generic algorithms. Yet, one of the particularities of FSM manipulation is the need of a fine grained specialization power on an object which is both an algebraic concept and an intensive computing machine. |
| abstract = Vaucanson is a C++ generic library for weighted finite state machine manipulation. For the sake of generality, FSM are defined using algebraic structures such as alphabet (for the letters), free monoid (for the words), semiring (for the weights) and series (mapping from words to weights). As usual, what is at stake is to maintain efficiency while providing a high-level layer for the writing of generic algorithms. Yet, one of the particularities of FSM manipulation is the need of a fine grained specialization power on an object which is both an algebraic concept and an intensive computing machine. |
||
| lrdepaper = http://www.lrde.epita.fr/dload/papers/poosc03-vaucanson.pdf |
| lrdepaper = http://www.lrde.epita.fr/dload/papers/poosc03-vaucanson.pdf |
||
− | | lrdeprojects = Vaucanson |
||
| lrdenewsdate = 2003-05-26 |
| lrdenewsdate = 2003-05-26 |
||
| type = inproceedings |
| type = inproceedings |
||
Line 33: | Line 31: | ||
address = <nowiki>{</nowiki>Darmstadt, Germany<nowiki>}</nowiki>, |
address = <nowiki>{</nowiki>Darmstadt, Germany<nowiki>}</nowiki>, |
||
month = jul, |
month = jul, |
||
− | project = <nowiki>{</nowiki>Vaucanson<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>Vaucanson is a C++ generic library for weighted finite |
abstract = <nowiki>{</nowiki>Vaucanson is a C++ generic library for weighted finite |
||
state machine manipulation. For the sake of generality, FSM |
state machine manipulation. For the sake of generality, FSM |
Revision as of 12:15, 26 April 2016
- Authors
- Yann Régis-Gianas, Raphaël Poss
- Where
- Proceedings of the Parallel/High-performance Object-Oriented Scientific Computing (POOSC; in conjunction with ECOOP)
- Place
- Darmstadt, Germany
- Type
- inproceedings
- Projects
- Vaucanson
- Date
- 2003-05-26
Abstract
Vaucanson is a C++ generic library for weighted finite state machine manipulation. For the sake of generality, FSM are defined using algebraic structures such as alphabet (for the letters), free monoid (for the words), semiring (for the weights) and series (mapping from words to weights). As usual, what is at stake is to maintain efficiency while providing a high-level layer for the writing of generic algorithms. Yet, one of the particularities of FSM manipulation is the need of a fine grained specialization power on an object which is both an algebraic concept and an intensive computing machine.
Documents
Bibtex (lrde.bib)
@InProceedings{ regisgianas.03.poosc, author = {Yann R\'egis-Gianas and Rapha\"el Poss}, title = {On orthogonal specialization in {C++}: dealing with efficiency and algebraic abstraction in {V}aucanson}, booktitle = {Proceedings of the Parallel/High-performance Object-Oriented Scientific Computing (POOSC; in conjunction with ECOOP)}, year = 2003, number = {FZJ-ZAM-IB-2003-09}, pages = {71--82}, editor = {J\"org Striegnitz and Kei Davis}, series = {John von Neumann Institute for Computing (NIC)}, address = {Darmstadt, Germany}, month = jul, abstract = {Vaucanson is a C++ generic library for weighted finite state machine manipulation. For the sake of generality, FSM are defined using algebraic structures such as alphabet (for the letters), free monoid (for the words), semiring (for the weights) and series (mapping from words to weights). As usual, what is at stake is to maintain efficiency while providing a high-level layer for the writing of generic algorithms. Yet, one of the particularities of FSM manipulation is the need of a fine grained specialization power on an object which is both an algebraic concept and an intensive computing machine.} }