Typed Static Analysis: Application to Groundness Analysis of Prolog and λ Prolog-Reference-Cited by-同舟云学术

Typed Static Analysis: Application to Groundness Analysis of Prolog and λ Prolog

Published:1999 Issue: Volume: Page:267-283
ISSN:0302-9743
Container-title:Functional and Logic Programming
language:
Short-container-title:

Author:

Ridoux Olivier,Boizumault Patrice,Malésieux Frédéric

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10705424_18

Reference20 articles.

1. Bonner, A.J.: Hypothetical datalog: Complexity and expressibility. Theoret- ical Computer Science 76, 3–51 (1990)

2. Brisset, P., Ridoux, O.: The compilation of λProlog and its execution with MALI. Rapport de recherche 1831, INRIA (1993)

3. Lecture Notes in Computer Science;M. Codish,1994

4. Codish, M., Demoen, B.: Analyzing logic programs using Prop-ositional logic programs and a magic wand. J. Logic Programming 25(3), 249–274 (1995)

5. Cortesi, A., Filé, G., Winsborough, W.: Prop revisited: Propositional for- mula as abstract domain for groundness analysis. In: SLCS, vol. CH3025-4, pp. 322–327. IEEE, Los Alamitos (1991)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Case Study in Functional Conversion and Mode Inference in miniKanren;Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11

2. A Framework for Developing Embeddable Customized Logics;Logic Based Program Synthesis and Transformation;2002

3. Pos(T ): Analyzing Dependencies in Typed Logic Programs;Lecture Notes in Computer Science;2001

4. Well-Typed Logic Programs Are not Wrong;Functional and Logic Programming;2001