91 Hits in 3.1 sec

On the use of advanced logic programming languages in computational linguistics

Solange Coupet-Grimal, Olivier Ridoux
1995 The Journal of Logic Programming  
Prolog II also offers a built-in predicate that can be thought of independently from the rational trees, but that is pragmatically related to them.  ...  So, one can reconstruct an abstraction by solving problems of the following form: 3A3XVt(At) = (X t). The solution in X of the problem is the reconstructed abstraction.  ...  Thanks must also go to David Trotman and Luke Hornof for their careful reading of the paper.  ... 
doi:10.1016/0743-1066(95)00040-q fatcat:ph7ll7eoinekvll3i6o5ktyqsa


Ikuo Takeuchi, Hiroshi Okuno, Nobuyasu Ohsato
1983 SIGPLAN notices  
TAO is a "harmonic" mean of Lisp, Prolog and Smalltalk i n the sense : 3 TAO = • ° 1 1 1 Lisp Prolog Smalltal k instead of a simple arithmetic mean : Lisp + Prolog + Smalltal k TAO = 3 Backgroun d First  ...  Though TAO looks lik e another newcomer of Lisp dialects at a glance, it takes in features of Prolog [1] , Smalltalk [2] and even Fortran .  ... 
doi:10.1145/988216.988224 fatcat:xd7qy6c75vhgrj5hviy5za7vpi

Implementing type theory in higher order constraint logic programming

2019 Mathematical Structures in Computer Science  
Indeed, we easily obtain a type checker for the Calculus of Inductive Constructions (CIC).  ...  level via constraint handling rules.We implement the proposed language extension in the Embedded Lambda Prolog Interpreter system and we discuss how it can be used to extend the kernel into an elaborator  ...  Introduction A pragmatic reconstruction of λProlog In (Belleanne et al., 1998) Belleannée et. al.  ... 
doi:10.1017/s0960129518000427 fatcat:ueu5trl4erfv3kn6xrlewifftm

In Praise of Impredicativity: A Contribution to the Formalisation of Meta-Programming [article]

François Bry
2019 arXiv   pre-print
Reflective Predicate Logic, a conservative extension of first-order logic, which provides a simple formalisation of meta-programming.  ...  In logic programming, there is a gap between the meta-programming practice and its theory: The formalisations of meta-programming do not explicitly address its impredicativity and are not fully adequate  ...  like the decidability of unification. λ Prolog is based on the Simply Typed Lambda Calculus (30; 6).  ... 
arXiv:1807.06051v3 fatcat:7b3yzhf5u5awngbvqndvarfbhm

In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming

2019 Theory and Practice of Logic Programming  
Reflective Predicate Logic, a conservative extension of first-order logic, which provides a simple formalization of meta-programming.  ...  In logic programming, there is a gap between the meta-programming practice and its theory: The formalizations of meta-programming do not explicitly address its impredicativity and are not fully adequate  ...  Because of the Unique-Prime-Factorization theorem, a formula F can be reconstructed from its Gödel number G(F ), that is, the naming relation is structure hiding.  ... 
doi:10.1017/s1471068419000024 fatcat:et7sxc5fjzaxzjelpgh3os4jxu

Computational linguistics and formal semantics

1993 ChoiceReviews  
Hardbound, ISBN 0-521-41959-X, $74.95; Paperbound, ISBN 0-521-42988-9, $24.95 Reviewed by John Nerbonne University of Groningen This is a collection of excellent papers from a workshop, chaired by the  ...  The title (and the preface) suggest a thematic cohesion among papers that is actually lacking. Only some of the papers actually focus on relating FS to computational linguistics.  ...  The book lacks an index, although one is promised in the table of contents, but is otherwise competently produced.  ... 
doi:10.5860/choice.31-0105 fatcat:thzbnazmfjgdtl2zslspamrp4m

Mode and termination checking for higher-order logic programs [chapter]

Ekkehard Rohwedder, Frank Pfenning
1996 Lecture Notes in Computer Science  
We consider how mode (such as input and output) and termination properties of typed higher-order constraint logic programming languages may be declared and checked effectively.  ...  We would like to thank the anonymous referees for their helpful comments and Brian Milnes for supplying us with a user's perspective on the checker implementation.  ...  We discuss pragmatic aspects of our implementation and provide an assessment in Section 5.  ... 
doi:10.1007/3-540-61055-3_44 fatcat:dxhzfvkgg5bkba6sizrg7qmkdy

Using Prolog for Transforming XML Documents [article]

René Haberland
2021 arXiv   pre-print
Based on this implementation a comparison between XSLT and Prolog follows. First, criteria are researched, such as considered language features of XSLT, usability and expressibility.  ...  Proponents of the programming language Prolog share the opinion Prolog is more appropriate for transforming XML-documents as other well-established techniques and languages like XSLT.  ...  The adaptions are due to missing features in Prolog and have been replaced by more pragmatic solutions instead.  ... 
arXiv:1912.10817v2 fatcat:ipcltqdwo5gzzoewzzxatwjol4

Fifty Years of Prolog and Beyond [article]

Philipp Körner, Michael Leuschel, João Barbosa, Vítor Santos Costa, Verónica Dahl, Manuel V. Hermenegildo, Jose F. Morales, Jan Wielemaker, Daniel Diaz, Salvador Abreu, Giovanni Ciatto
2022 arXiv   pre-print
Both logic programming in general, and Prolog in particular, have a long and fascinating history, intermingled with that of many disciplines they inherited from or catalyzed.  ...  Finally, we perform a SWOT analysis in order to better identify the potential of Prolog, and propose future directions along which Prolog might continue to add useful features, interfaces, libraries, and  ...  The authors also endorse Paul McJones' efforts to maintain a historical archive on Prolog, at, and thank all contributors.  ... 
arXiv:2201.10816v3 fatcat:grixngoazrdfjosno4zvnimsnq

The Impact of the Lambda Calculus in Logic and Computer Science

Henk Barendregt
1997 Bulletin of Symbolic Logic  
One of the most important contributions of A. Church to logic is his invention of the lambda calculus.  ...  of reasoning and the resulting systems of computer mathematics on the other hand.  ...  But so far pure logical languages of industrial quality have not been developed. (Prolog is not pure and /-Prolog, see [87] , although pure, is presently a prototype.)  ... 
doi:10.2307/421013 fatcat:v7nedk3s3vfk3mob6ao5sl4b74

Constraint logic programming: a survey

Joxan Jaffar, Michael J. Maher
1994 The Journal of Logic Programming  
LA [ 1891 and Elf [200] are derived from h-Prolog [ 1901 and compute over the values of closed typed lambda expressions.  ...  A final remark: this reconstruction approach has the added advantage of incurring cost only when backtracking actually takes place.  ...  We would like to thank the following people for their comments on drafts of this paper and/or help in other ways: M. Bruynooghe, N. Heintze, P. van Hentenryck, A. Herold, J. -L. Lassez, S.  ... 
doi:10.1016/0743-1066(94)90033-7 fatcat:rg3sfyyn3vblrbvu43hltau2eu

Natural language processing and logic programming

Veronica Dahl
1994 The Journal of Logic Programming  
Our presentation of different approaches is centered whenever possible around treatment of one particular phenomenon, which serves as an axis of discussion throughout the article: long-distance dependencies  ...  We concentrate on syntax, the most studied aspect of language processing.  ...  Another problem is that of the ambiguity that plagues natural language, and is exacerbated in written interactions with a computer by the lack of pragmatic clues, intonation clues, etc.  ... 
doi:10.1016/0743-1066(94)90036-1 fatcat:txdqkmwyvjgmfjtn6yt2dpwr4a

The Family of Concurrent Logic Programming Languages [chapter]

Ehud Shapiro
1991 Logic, Algebra, and Computation  
reconstruction, can be used [118] .  ...  In addition, it has the added pragmatic advantage over FCP(?)  ... 
doi:10.1007/978-3-642-76799-9_10 fatcat:rjyl5efexfgdnirsslmzgsgl3u

The family of concurrent logic programming languages

Ehud Shapiro
1989 ACM Computing Surveys  
reconstruction, can be used [118] .  ...  In addition, it has the added pragmatic advantage over FCP(?)  ... 
doi:10.1145/72551.72555 fatcat:ywvqbl5bkve3jlv37ffkynwksa

Practical aspects of declarative debugging in Haskell 98

Bernard Pope, Lee Naish
2003 Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming - PPDP '03  
At the heart of the debugger is a tree which records information about the evaluation of the program in a manner which is easy to relate to the structure of the program.  ...  We build a debugger which focuses on the high-level logical meaning of a program rather than its evaluation order.  ...  Instead we opted for a more pragmatic solution, based on an interface to the runtime system of GHC by way of the FFI.  ... 
doi:10.1145/888251.888273 dblp:conf/ppdp/PopeN03 fatcat:yoyz5zy4yjhlfhasmhm34x6ovi
« Previous Showing results 1 — 15 out of 91 results