| 4 |
The Answer Validation ProdicosAV System dedicated to French
|
|
|
|
In: Proceedings of Evaluating Systems for Multilingual and Multimodal Information Access ; 9th Workshop of the Cross-Language Evaluation Forum, CLEF 2008, Revised Selected Papers ; https://hal.archives-ouvertes.fr/hal-00412450 ; 9th Workshop of the Cross-Language Evaluation Forum, CLEF 2008, Revised Selected Papers, Sep 2008, Aarhus, Denmark. pp.8 (2008)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
French EuroWordNet Lexical Database Improvements
|
|
|
|
In: Lectures Notes of computer sciences ; 8th international conference on Computational Linguistics and Intelligent Text Processing (CICLing) ; https://hal.archives-ouvertes.fr/hal-00472023 ; 8th international conference on Computational Linguistics and Intelligent Text Processing (CICLing), Feb 2007, Mexico, Mexico. pp.12-22 (2007)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
J. Kittler and M.S. Nixon (Eds.): AVBPA 2003, LNCS 2688, pp. 208-213, 2003.
|
|
|
|
In: http://fierrez.ii.uam.es/docs/2003_AVBPA_Unorm_GRomero.pdf (2003)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
|
|
|
|
In: Proceedings of the 13th International Conference on Rewriting Systems ; 13th International Conference on Rewriting Techniques and Applications ; https://hal.archives-ouvertes.fr/hal-00344294 ; 13th International Conference on Rewriting Techniques and Applications, 2002, Denmark. pp.371--375 (2002)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
On the Modularity of Deciding Call-by-Need
|
|
|
|
In: Foundations of Software Science and Computation Structures ; https://hal.archives-ouvertes.fr/hal-00344304 ; Foundations of Software Science and Computation Structures, 2001, Italy. pp.199-213 (2001)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Cross-Language Information Retrieval using Dutch Query Translation
|
|
|
|
In: Instructional Technology and Learning Sciences Faculty Publications (2000)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
E. Jul (Ed.): ECOOP'98, LNCS 1445, pp.13-40, 1998.
|
|
|
|
In: http://www.ifs.uni-linz.ac.at/~ecoop/cd/papers/1445/14450013.pdf (1998)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Decidable Call by Need Computations in Term Rewriting
|
|
|
|
In: Proceedings of the 14th International Conference on Automated Deduction ; 14th International Conference on Automated Deduction ; https://hal.archives-ouvertes.fr/hal-00344328 ; 14th International Conference on Automated Deduction, 1997, Australia. pp.4--18 (1997)
|
|
Abstract:
International audience ; The following theorem of Huet and Lévy [HL79] forms the basis of all results on optimal normalizing reduction strategies for orthogonal term rewriting systems (TRSs): every reducible term contains a needed redex, i.e., a redex which is contracted in every rewrite sequence to normal form, and repeated contraction of needed redexes results in a normal form, if the term under consideration has a normal form. Unfortunately, needed redexes are not computable in general. Hence, in order to obtain a computable optimal reduction strategy, we are left to find (1) decidable approximations of neededness and (2) decidable properties of TRSs which ensure that every reducible term has a needed redex identified by (1). Starting with the seminal work of Huet and Lévy [HL79] on strong sequentiality, these issues have been extensively investigated in the literature[C95,J96,JS95,KM91,NST95,O93,T92]. In all these works Huet and Lévy's notions of index, omega-reduction, and sequentiality figure prominently. We present an approach to decidable call by need computations to normal form in which issues (1) and (2) above are addressed directly. Besides facilitating understanding this enables us to cover much larger classes of TRSs. For instance, an easy consequence of our work is that every orthogonal right-ground TRS admits a computable call by need strategy whereas none of the sequentiality-based approaches cover all such TRSs. Our approach is based on the easy but fundamental observation that needed redexes are uniform but not independent of other redexes in the same term. Uniformity means that only the position of a redex in a term counts for determining neededness.
|
|
Keyword:
[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]; call-by-need computations; term rewriting
|
|
URL: https://hal.archives-ouvertes.fr/hal-00344328
|
|
BASE
|
|
Hide details
|
|
|
| 12 |
Mathematical Foundations of Programming Semantics International Conference (9th) Held in New Orleans, Louisiana, April 1993
|
|
|
|
In: DTIC AND NTIS (1993)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
Computational Mathetics: the missing link in Intelligent Tutoring Systems research?
|
|
|
|
In: ftp://ftp.comp.lancs.ac.uk/pub/aai/aai-report-77.ps.Z (1992)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Emergence Cangelosi, A., and editors, Evolution Emergence of Linguistic of Communication.
|
|
|
|
In: http://www.ling.ed.ac.uk/~simon/Papers/Ritchie/Selection,%20domestication,%20and%20the%20emergence%20of%20learned%20communication.pdf
|
|
BASE
|
|
Show details
|
|
|
|
|
