Suchergebnisse - Extensional higher-order logic programming

Andere Suchmöglichkeiten:

  1. 1

    Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation von CHARALAMBIDIS, ANGELOS, ÉSIK, ZOLTÁN, RONDOGIANNIS, PANOS

    ISSN: 1471-0684, 1475-3081
    Veröffentlicht: Cambridge, UK Cambridge University Press 01.07.2014
    Veröffentlicht in Theory and practice of logic programming (01.07.2014)
    “… Extensional higher-order logic programming has been introduced as a generalization of classical logic programming …”
    Volltext
    Journal Article
  2. 2

    Equivalence of two fixed-point semantics for definitional higher-order logic programs von Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna

    ISSN: 0304-3975, 1879-2294
    Veröffentlicht: Elsevier B.V 15.03.2017
    Veröffentlicht in Theoretical computer science (15.03.2017)
    “… Two distinct research approaches have been proposed for assigning extensional semantics to higher-order logic programming …”
    Volltext
    Journal Article
  3. 3

    The intricacies of three-valued extensional semantics for higher-order logic programs von RONDOGIANNIS, PANOS, SYMEONIDOU, IOANNA

    ISSN: 1471-0684, 1475-3081
    Veröffentlicht: Cambridge, UK Cambridge University Press 01.09.2017
    Veröffentlicht in Theory and practice of logic programming (01.09.2017)
    “… M. Bezem defined an extensional semantics for positive higher-order logic programs …”
    Volltext
    Journal Article
  4. 4

    Extensional Higher-Order Logic Programming von Charalambidis, A, Handjopoulos, K, Rondogiannis, P, Wadge, W W

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 17.06.2011
    Veröffentlicht in arXiv.org (17.06.2011)
    “… We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets …”
    Volltext
    Paper
  5. 5

    Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation von Charalambidis, Angelos, Ésik, Zoltán, Rondogiannis, Panos

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 15.05.2014
    Veröffentlicht in arXiv.org (15.05.2014)
    “… Extensional higher-order logic programming has been introduced as a generalization of classical logic programming …”
    Volltext
    Paper
  6. 6

    Extensional Semantics for Higher-Order Logic Programs with Negation von Rondogiannis, Panos, Symeonidou, Ioanna

    ISSN: 1860-5974, 1860-5974
    Veröffentlicht: Logical Methods in Computer Science e.V 29.06.2018
    Veröffentlicht in Logical methods in computer science (29.06.2018)
    “… We develop an extensional semantics for higher-order logic programs with negation, generalizing the technique that was introduced in [Bezem99,Bezem01 …”
    Volltext
    Journal Article
  7. 7

    Extensional Semantics for Higher-Order Logic Programs with Negation von Rondogiannis, Panos, Symeonidou, Ioanna

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 28.06.2018
    Veröffentlicht in arXiv.org (28.06.2018)
    “… We develop an extensional semantics for higher-order logic programs with negation, generalizing the technique that was introduced in [Bezem99,Bezem01 …”
    Volltext
    Paper
  8. 8

    Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs von Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna

    ISSN: 2075-2180, 2075-2180
    Veröffentlicht: Open Publishing Association 09.09.2015
    “… Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming …”
    Volltext
    Journal Article
  9. 9

    Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs von Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 10.09.2015
    Veröffentlicht in arXiv.org (10.09.2015)
    “… Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming …”
    Volltext
    Paper
  10. 10

    Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs von Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 23.04.2018
    Veröffentlicht in arXiv.org (23.04.2018)
    “… We define a novel, extensional, three-valued semantics for higher-order logic programs with negation …”
    Volltext
    Paper
  11. 11

    Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs von CHARALAMBIDIS, ANGELOS, RONDOGIANNIS, PANOS, SYMEONIDOU, IOANNA

    ISSN: 1471-0684, 1475-3081
    Veröffentlicht: Cambridge, UK Cambridge University Press 01.07.2018
    Veröffentlicht in Theory and practice of logic programming (01.07.2018)
    “… We define a novel, extensional, three-valued semantics for higher-order logic programs with negation …”
    Volltext
    Journal Article
  12. 12

    The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs von Rondogiannis, Panos, Symeonidou, Ioanna

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 15.07.2017
    Veröffentlicht in arXiv.org (15.07.2017)
    “… In (Bezem 1999; Bezem 2001), M. Bezem defined an extensional semantics for positive higher-order logic programs …”
    Volltext
    Paper
  13. 13

    A HIGHER-ORDER LOGIC AS THE BASIS FOR LOGIC PROGRAMMING von NADATHUR, GOPALAN

    ISBN: 9798206578683
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.1987
    “… The objective of this thesis is to provide a formal basis for higher-order features in the paradigm of logic programming …”
    Volltext
    Dissertation
  14. 14

    Extensional Paramodulation for Higher-Order Logic and Its Effective Implementation Leo-III von Steen, Alexander

    ISSN: 0933-1875, 1610-1987
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020
    Veröffentlicht in KI. Künstliche Intelligenz (Oldenbourg) (01.03.2020)
    “… Automation of classical higher-order logic faces various theoretical and practical challenges …”
    Volltext
    Magazine Article
  15. 15

    Programming languages and systems : 32nd European Symposium on Programming, ESOP 2023, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023 : proceedings von Wies, Thomas

    ISBN: 3031300432, 9783031300431, 9783031300448, 3031300440
    Veröffentlicht: Cham Springer 2023
    “… This open access book constitutes the proceedings of the 32nd European Symposium on Programming, ESOP 2023, which was held during April 22-27, 2023, in Paris, France, as part of the European Joint …”
    Volltext
    E-Book Buch
  16. 16

    Decalf: A Directed, Effectful Cost-Aware Logical Framework von Grodin, Harrison, Niu, Yue, Sterling, Jonathan, Harper, Robert

    ISSN: 2475-1421, 2475-1421
    Veröffentlicht: New York, NY, USA ACM 02.01.2024
    Veröffentlicht in Proceedings of ACM on programming languages (02.01.2024)
    “… We present decalf, a directed, effectful cost-aware logical framework for studying quantitative aspects of functional programs with effects. Like calf, the …”
    Volltext
    Journal Article
  17. 17

    The Full Abstraction Problem for Higher Order Functional-Logic Programs von López-Fraguas, F J, Rodríguez-Hortalá, J

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 09.02.2010
    Veröffentlicht in arXiv.org (09.02.2010)
    “… In this work we address the question of full abstraction for the family of modern functional logic languages, in which functions can be higher order and non-deterministic, and where the …”
    Volltext
    Paper
  18. 18

    Linear dependent types in a call-by-value scenario von Dal Lago, Ugo, Petit, Barbara

    ISSN: 0167-6423, 1872-7964
    Veröffentlicht: Elsevier B.V 01.05.2014
    Veröffentlicht in Science of computer programming (01.05.2014)
    “… Linear dependent types were introduced recently (Dal Lago and Gaboardi, 2012) [26] as a formal system that allows to precisely capture both the extensional behavior and the time complexity …”
    Volltext
    Journal Article
  19. 19

    Bistable Biorders: A Sequential Domain Theory von Laird, James

    ISSN: 1860-5974, 1860-5974
    Veröffentlicht: Logical Methods in Computer Science e.V 15.05.2007
    Veröffentlicht in Logical methods in computer science (15.05.2007)
    “… (with atomic constants), and an extension with arithmetic and recursion. We also construct a bistable model of SPCF, a higher-order functional programming language …”
    Volltext
    Journal Article
  20. 20

    Higher-order functional languages and intensional logic von Rondogiannis, Panagiotis

    ISBN: 9780612083233, 0612083233
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.1995
    “… The purpose of this dissertation is to demonstrate that higher-order functional programs can be transformed into zero-order intensional ones in a semantics preserving way …”
    Volltext
    Dissertation