Solange Coupet-Grimal, Olivier Ridoux  Home/Search
Context
Related
| irisa.fr/local/lande/scorjlp95.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: irisa.fr/EXTERNE/p...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ion can be understood as defining functions. It introduces the notion of free and bound occurrences of variables: occurrences of variable x outside all abstractions x(E) are free, otherwise they are bound. The main axiom of the theory is called fi: ( x(E) F ) = fi E[x/F], if free variables of F do not occur bound in E. The intuition of this axiom is the function call, and the consistent substitution of an actual parameter, F, to a formal parameter, x. To fi-reduce is to use the axiom as a... (Update)
Similar documents (at the sentence level):
52.3%: On The Use Of Advanced Logic Programming Languages In.. - Coupet-Grimal, Ridoux (1994) (Correct)
Active bibliography (related documents): More All
0.8: Logic Grammars and λProlog - Le Huitouze, Louvet, Ridoux (1993) (Correct)
0.5: Some Uses of Higher-Order Logic in Computational Linguistics - Miller, Nadathur (1986) (Correct)
0.4: A Pragmatic Reconstruction of λProlog - Belleannée, Brisset, Ridoux (1994) (Correct)
Similar documents based on text: More All
0.2: Statistics - Canada Statistique Statistics (Correct)
0.2: Tools for Locating Noun Phrases With Finite State Transducers. - Jean Senellart Ladl (Correct)
0.2: Epistemic NP Modifiers - Abusch, Rooth (1997) (Correct)
BibTeX entry: (Update)
@article{ coupetgrimal95use,
author = "Solange Coupet-Grimal and Olivier Ridoux",
title = "On the Use of Advanced Logic Programming Languages in Computational Linguistics",
journal = "Journal of Logic Programming",
volume = "24",
number = "1&2",
pages = "121-159",
year = "1995",
url = "citeseer.ist.psu.edu/article/coupet-grimal94use.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
809 A theory of type polymorphism in programming (context) - Milner - 1978
729 The lambda calculus: its syntax and semantics (context) - Barendregt - 1981
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
440 The Art of Prolog (context) - Sterling, Shapiro - 1986
419 A formulation of the simple theory of types (context) - Church - 1940
363 Programming in Prolog (context) - Clocksin, Mellish - 1987
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
271 YACC --- yet another compiler compiler - Johnson - 1978
261 An introduction to Prolog III (context) - Colmerauer - 1990
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1994
242 Generalized Phrase Structure Grammar (context) - Gazdar, Klein et al. - 1985
162 The semantics of predicate logic as a programming language (context) - Kowalski, Van Emden - 1976
119 Login: a logic programming language with built-in inheritanc.. (context) - Ait-Kaci, Nasr - 1986
109 A polymorphic type system for Prolog (context) - Mycroft, O'Keefe - 1984
101 Higher-order logic programming - Miller, Nadathur - 1986
101 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
97 The Craft of Prolog (context) - O'Keefe - 1990
72 Prolog and infinite trees (context) - Colmerauer - 1982
68 Unification: a multidisciplinary survey (context) - Knight - 1989
63 Logic Programming in Intuitionistic Linear Logic: Theory (context) - Hodas - 1993
58 Memoing for logic programs (context) - Warren - 1992
43 Typed Prolog: a semantic reconstruction of the Mycroft-O'Kee.. (context) - Lakshman, Reddy - 1991
38 Symbolic computation --- Artificial Intelligence (context) - Lloyd, Logic - 1987
33 A Mechanical Proof of the Church-Rosser Theorem (context) - Shankar - 1985
28 Specifying filler-gap dependency parsers in a linear-logic p.. - Hodas - 1992
27 Metamorphosis grammars (context) - Colmerauer - 1978
26 Extending definite clause grammars with scoping constructs (context) - Pareschi, Miller - 1990
18 Some uses of higher-order logic in computational linguistics - Miller, Nadathur - 1986
17 The Compilation of Prolog and its execution with MALI - Brisset, Ridoux - 1993
13 Definite clauses for language analysis (context) - Pereira, Warren - 1980
10 Natural Language Understanding and Logic Programming (context) - Dahl, Saint-Dizier et al. - 1985
10 Natural Language Understanding and Logic Programming (context) - Dahl, Saint-Dizier et al. - 1988
9 Logic for Natural Language Analysis (context) - Pereira - 1983
7 Logic grammars and Prolog (context) - Le Huitouze, Louvet et al. - 1993
7 Prolog for Natural Language Processing - Gal, Lapalme et al. - 1992
6 Interactive synthesis of definite-clause grammars (context) - Haas, Jayaraman - 1992
6 Prolog and natural-language analysis: into the third decade (context) - Pereira - 1990
6 A definite clause version of categorial grammar - Pareschi - 1988
5 Translating Spanish into logic through logic - Dahl - 1981
5 emes-Q ou un formalisme pour analyser et synth (context) - Colmerauer - 1970
5 Using slots and modifiers in logic grammars for natural lang.. (context) - McCord - 1982
4 Symbolic computation --- Artificial Intelligence (context) - Abramson, Dahl - 1989
4 bases th'eoriques et d'eveloppements actuels (context) - Colmerauer, Kanoui et al. - 1982
4 Advanced Logic Programming for Language Processing (context) - Saint-Dizier - 1994
3 Natural Language Understanding and Logic Programming (context) - Brown, Koch - 1980
3 The proper treatement of quantification in ordinary English (context) - Montague - 1974
2 Using -calculus to represent meanings in logic grammars (context) - Warren - 1983
2 a semantic representation of natural language sentences (context) - Pique - 1982
2 An approach to natural language semantics in logic programmi.. (context) - Saint-Dizier - 1986
2 ese, Universit (context) - Coupet-Grimal, pour et al. - 1988
2 An interesting subset of natural language (context) - Colmerauer - 1982
2 RAIRO Informatique Th'eorique et Applications (context) - Coupet-Grimal, trees - 1991
1 Intuitionistic implication and resolution (context) - Bon - 1994
Documents on the same site (http://www.irisa.fr/EXTERNE/projet/lande/BIBLIO/publications.html): More
Imagining CLP(Λ,≡αβ) - Ridoux (1995) (Correct)
Refining Multiset Transformers - Hankin, Métayer, Sands (Correct)
The Architecture of an Implementation of λProlog.. - Brisset, Ridoux (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC