Search for Author All Reviews
	Bruynooghe, Maurice     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Termination analysis of logic programs through combination of type-based norms Bruynooghe M., Codish M., Gallagher J., Genaim S., Vanhoof W. ACM Transactions on Programming Languages and Systems 29(2): 10-es, 2007.  Type: Article Establishing that all computations terminate is a fundamental, though generally undecidable, property of computer programs. Therefore, termination analyses that approximate this property have been developed for different programming la...... Aug 29 2007     Binding-time analysis for Mercury Vanhoof W., Bruynooghe M.  Logic programming (Proceedings of the 1999 International Conference on Logic Programming, Las Cruces, New Mexico, United States, 500-514, 1999.  Type: Proceedings Partial evaluation (or program specialization) is a technique that transforms a program into another program, by pre-computing some of its operations. This kind of program transformation typically has been approached from two points of...... Oct 14 2004     Logic programming revisited: logic programs as inductive definitions Denecker M. (ed), Bruynooghe M., Marek V. ACM Transactions on Computational Logic 2(4): 623-654, 2001.  Type: Article The problem of the existence of multiple “commonsense” meanings of logic programming, which cause the complexity of logic programming semantics, is addressed in this paper. The authors propose an alternative episte...... Jul 31 2002     Improving abstract interpretations by combining domains Codish M., Mulkers A., Bruynooghe M., de la Banda M., Hermenegildo M. ACM Transactions on Programming Languages and Systems 17(1): 28-44, 1995.  Type: Article In the abstract setting of domain theory, the meaning of a program P is expressed as the least fixed point of a monotonic operator f P on a domain E. In the developmen...... Sep 1 1996     Live-structure dataflow analysis for Prolog Mulkers A., Winsborough W., Bruynooghe M. ACM Transactions on Programming Languages and Systems 16(2): 205-258, 1994.  Type: Article Conventional implementations of applicative programming languages perform garbage collection at runtime in a nonoptimal way. Eventually, a request for new storage cannot be satisfied because of space exhaustion, at which moment unused ...... Apr 1 1995
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy