Search for Author All Reviews
	Antoy, Sergio     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 6 reviews       Transforming Boolean equalities into constraints Antoy S., Hanus M. Formal Aspects of Computing 29(3): 475-494, 2017.  Type: Article In declarative programming languages, a variable is a symbol representing a value determined by computational rules rather than a space in memory. The two main forms of declarative languages are functional and logic. In functional lang...... Sep 13 2017     Conditional narrowing without conditions Antoy S., Brassel B., Hanus M.  Principles and practice of declaritive programming (Proceedings of the 5th ACM SIGPLAN international conference, Uppsala, Sweden, Aug 27-29, 2003) 20-31, 2003.  Type: Proceedings Functional logic programming integrates the best features of the functional and logic programming paradigms into a single framework. This multi-paradigm approach usually considers term rewriting systems as programs, and some variant of...... Nov 4 2003     Constructor-based conditional narrowing: a WAP mail retrieving system Antoy S.  Principles and practice of declarative programming (Third international conference, Florence, Italy, Sep 5-7, 2001) 199-206, 2001.  Type: Proceedings An overview and a systematization of the main results of optimized narrowing strategies are presented in this paper, which also corrects some imprecise claims made in the literature on this topic. The paper also demonstrates how to tra...... Jul 17 2003     Automatically Checking an Implementation against Its Formal Specification Antoy S., Hamlet D. IEEE Transactions on Software Engineering 26(1): 55-69, 2000.  Type: Article Generating test oracles is a hard problem that has not yet been adequately addressed. This paper provides some important insights by proposing a technique for generating test oracles for C++ or Java classes from abstract data type spec...... May 1 2000     A sequential reduction strategy Antoy S., Middeldorp A. Theoretical Computer Science 165(1): 75-95, 1996.  Type: Article The authors simplify the proof of Kennaway’s result [1] that every almost orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. First, the authors refine the usual definition of a seq...... Apr 1 1998     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy