Xref: utzoo comp.compilers:1289 comp.lang.prolog:3182 Path: utzoo!utgpu!news-server.csri.toronto.edu!clyde.concordia.ca!uunet!world!esegue!compilers-sender From: hawley@icot32.icot.or.jp (David John Hawley) Newsgroups: comp.compilers,comp.lang.prolog Subject: Re: Help on disassembler/decompilers Keywords: debug Message-ID: <7572@icot32.icot.or.jp> Date: 15 Sep 90 01:34:44 GMT References: <1990Sep9.010032.23235@sco.COM> <433@necssd.NEC.COM> <679@culhua.prg.ox.ac.uk> Sender: compilers-sender@esegue.segue.boston.ma.us Reply-To: hawley@icot32.icot.or.jp (David John Hawley) Followup-To: comp.compilers Organization: Fifth Generation Computing Systems (ICOT), Tokyo, Japan Lines: 20 Approved: compilers@esegue.segue.boston.ma.us In article <679@culhua.prg.ox.ac.uk> Jonathan Bowen writes: >.... The main problem is running the necessary arithmetic backwards (i.e. >avoiding the use of "is") and I am currently looking into this. Has anyone >else done any similar work or can anyone supply any useful references? I'm not confident that that is the major problem, but as far as "more declarative" realizations of arithmetic (and other non-logical goodies), check out "constraint logic programming". See the recent pair of articles in the July/90 CACM - an interpreter and compiler are available for the CLP(R) language mentioned there (for academic use). If you are concerned about completeness issues for your "invertible 'is'", maybe you would be interested in our Grobner-base constraint solver, the "elephant gun approach" also mentioned in the above articles ;-) David Hawley, CAL group, ICOT -- Send compilers articles to compilers@esegue.segue.boston.ma.us {ima | spdcc | world}!esegue. Meta-mail to compilers-request@esegue.