Reading PAGE
Peer Evaluation activity
| Trusted by | 2 |
| Views | 6 |
Total impact ?
Send a 
Claudio has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
This was brought to you by:
Followblock this user Claudio Sacerdoti Coen Trusted member
Lecturer
Dipartimento Di Scienze dell'Informazione, Universita' di Bologna
2004, �Efficient Ambiguous Parsing of Mathematical Formulae
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Description
Title : 2004, �Efficient Ambiguous Parsing of Mathematical Formulae
Area : Computer Science
Language : English
Url : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.66.6117&rep=rep1&type=pdf
Doi : 10.1.1.66.6117
Abstract : 1 Introduction Mathematicians are used to well established and ambiguous notational conven-tions. To design a software application which have to deal with mathematical formulae, we have to consider this habit. Sometimes a mathematician who is reading a formula, solves the ambiguityusing the notion of context: for instance, if
Subject : unspecifiedArea : Computer Science
Language : English
| Affiliations : |
Doi : 10.1.1.66.6117
Leave a comment
This contribution has not been reviewed yet. review?
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation to sign your evaluation:
Please select an affiliation:
Claudio's Peer Evaluation activity
| Trusted by | 2 |
- FPeer Evaluation, Publisher, Peer Evaluation.
- FPierre Lescanne, Professor, LIP, ENS de Lyon, LYON, France.
| Views | 6 |
- 11 Declarative Representation of Proof Terms
- 1A constructive proof of the soundness of the encoding of random access machines in a linda calculus with ordered semantics
- 1Brokers and Web-services for automatic deduction: a case study
- 1Calculus of (co)Inductive Constructions: Part I
- 1Crafting a Proof Assistant
- 1Formal Mathematics on the Web
Claudio has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
Full Text request
Your request will be sent.
Please enter your email address to be notified
when this article becomes available
Your email