cl-unification-devel

cl-unification-devel@common-lisp.net

63 discussions

Start a nNew thread

[cl-unification-devel] Is this now working?
by Marco Antoniotti 08 Apr '15

08 Apr '15

-- Marco Antoniotti

1 0

[Cl-unification-devel] Test
by Marco Antoniotti 06 Jan '15

06 Jan '15

Is this working? -- Marco Antoniotti

2 4

Re: [cl-unification-devel] MATCH and friends usage and changes
by Marco Antoniotti 04 Dec '12

04 Dec '12

On Dec 4, 2012, at 04:52 , Pixie <pix(a)kepibu.org> wrote: > On 2012.12.03 09:31, Marco Antoniotti wrote: >> Dear all (the few, the self-chosen :) lurking here) >> >> I have been fiddling about with a "pattern compiler" to be made part >> of a compiler-macro for MATCH-CASE. After reading a few things here >> and there, I came to the conclusion that for CL and CL-UNIFICATION >> there is no need for anything particularly sophisticated (things like >> "partial test/evaluation merging" and whatnot), but I also started to >> think that maybe it would be better to introduce new syntax. >> Something along the lines of >> >> (PAT (<object> &key …) <clauses>) >> >> Now. This may look simple, but suppose you wanted to do something >> like >> >> (let ((x 42)) (y 123)) (pat (x y) ((42 123) t) (_ 'not-matched))) >> >> Now, while in principle this is easy (you just have a "list" instead >> of an object as first element), things may become hairy very soon >> when you want to add keywords affecting the matching process (cfr the >> MATCH-CASE syntax >> >> match-case (<object> &key errorp default-substitution) <clauses> >> >> where grouping is used for the keyword variables errorp >> default-substitution). With this consideration in mind the above >> example would become >> >> (let ((x 42)) (y 123)) (pat ((x y)) ((42 123) t) (_ 'not-matched))) >> >> So the questions I have for you are two: (1) do you have any ideas >> about syntax, even at the cost of introducing some "spurious infix" >> bit? (2) the PAT above should be really be named MATCH-CASE, but >> that is already taken; for the sake of backward compatibility, do you >> think that PAT or CASE-MATCH or SELECT or whatever should be used for >> the new syntax? > > To be honest, I'm not sure I understand what problem you're trying to solve by adding this PAT thing. The extensibility of cl-unification via #t(...) is one of the things I love about it[1], and your PAT syntax doesn't appear to do much outside of lists--which, well, isn't that what the *F variants are for? Well, the PAT thingy is just a non-completely-backward-compatible version of MATCH-CASE. To tell the truth the problem is all there. Also, I have developed a form of Racket envy given their slew of match** forms. :) > Though if you're in the mood for cl-unification work, my cl-unification repo is still around[2], if you'd be interested in looking at and/or pulling patches from it. ;) Somewhere in the archives of this mailing list is a listing of what I changed and why. (Goodness, has it been several years already?!) Well, yes. In some ways this says that the library is pretty solid :) I believe I did incorporate at least some of your patches in the main trunk. I will have a look at your repo (and I should bite the bullet and just switch to git as main repository) and see what is still left out. > [1] Though I've mentioned in the pre-Quicklisp days it'd be nice to > have some named-readtable support. Any specifics? > [2] http://repo.kepibu.org/cl-unification/ -- It's a few patches behind > CVS at the moment, alas. Thanks. -- Marco Antoniotti

2 1

[cl-unification-devel] MATCH and friends usage and changes
by Marco Antoniotti 04 Dec '12

04 Dec '12

Dear all (the few, the self-chosen :) lurking here) I have been fiddling about with a "pattern compiler" to be made part of a compiler-macro for MATCH-CASE. After reading a few things here and there, I came to the conclusion that for CL and CL-UNIFICATION there is no need for anything particularly sophisticated (things like "partial test/evaluation merging" and whatnot), but I also started to think that maybe it would be better to introduce new syntax. Something along the lines of (PAT (<object> &key …) <clauses>) Now. This may look simple, but suppose you wanted to do something like (let ((x 42)) (y 123)) (pat (x y) ((42 123) t) (_ 'not-matched))) Now, while in principle this is easy (you just have a "list" instead of an object as first element), things may become hairy very soon when you want to add keywords affecting the matching process (cfr the MATCH-CASE syntax match-case (<object> &key errorp default-substitution) <clauses> where grouping is used for the keyword variables errorp default-substitution). With this consideration in mind the above example would become (let ((x 42)) (y 123)) (pat ((x y)) ((42 123) t) (_ 'not-matched))) So the questions I have for you are two: (1) do you have any ideas about syntax, even at the cost of introducing some "spurious infix" bit? (2) the PAT above should be really be named MATCH-CASE, but that is already taken; for the sake of backward compatibility, do you think that PAT or CASE-MATCH or SELECT or whatever should be used for the new syntax? Cheers -- Marco Antoniotti

2 1

[cl-unification-devel] ELS 2012, Zadar, Croatia
by Marco Antoniotti 01 Feb '12

01 Feb '12

Apologies for the multiple postings. PAPER SUBMISSION DEADLINE EXTENDED European Lisp Symposium 2012, Zadar, Croatia, April 30th - May 1st, 2012 http://european-lisp-symposium.org The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp and Lisp-inspired dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, and so on. We encourage everyone interested in Lisp to participate. The main theme of the 2012 European Lisp Conference is "Interoperability: Systems, Libraries, Workflows". Lisp based and functional-languages based systems have grown a variety of solutions to become more and more integrated with the wider world of Information and Communication Technologies in current use. There are several dimensions to the scope of the solutions proposed, ranging from "embedding" of interpreters in C-based systems, to the development of abstractions levels that facilitate the expression of complex context dependent tasks, to the construction of exchange formats handling libraries, to the construction of theorem-provers for the "Semantic Web". The European Lisp Symposium 2012 solicits the submission of papers with this specific theme in mind, alongside the more traditional tracks which have appeared in the past editions. We invite submissions in the following forms: Papers: Technical papers of up to 15 pages that describe original results or explain known ideas in new and elegant ways. Demonstrations: Abstracts of up to 4 pages for demonstrations of tools, libraries, and applications. Tutorials: Abstracts of up to 4 pages for in-depth presentations about topics of special interest for at least 90 minutes and up to 180 minutes. Lightning talks: Abstracts of up to one page for talks to last for no more than 5 minutes. All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates and http://www.acm.org/about/class/1998. Important dates: February 15th 2012: submission deadline (extended deadline) March 7th 2012: acceptance results April 30th 2012: Conference opens Program Commitee. Chair: Marco Antoniotti, Università degli Studi di Milano Bicocca, Milan, ITALY Local organizers: Damir Cavar, Eastern Michigan University Franjo Pehar, University of Zadar Damir Kero, University of Zadar Members: Giuseppe Attardi, Università degli Studi di Pisa, Pisa, ITALY Pascal Costanza, Intel, Bruxelles, BELGIUM Marc Feeley, Université de Montreal, Montreal, CANADA Scott McKay, Google, U.S.A. Kent Pitman, U.S.A. Christophe Rhodes, Department of Computing, Goldsmiths, University of London, London, UNITED KINGDOM Robert Strandh, LABRI, Université de Bordeaux, Bordaux, FRANCE Didier Verna, EPITA / LRDE, FRANCE Taiichi Yuasa, Kyoto University, JAPAN -- Marco Antoniotti

1 0

[cl-unification-devel] ELS2012 Zadar, Croatia, Call for Papers
by Marco Antoniotti 23 Jan '12

23 Jan '12

Apologies for the multiple postings... =========================================================================== European Lisp Symposium 2012, Zadar, Croatia, April 30th - May 1st, 2012 http://european-lisp-symposium.org The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp and Lisp-inspired dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, and so on. We encourage everyone interested in Lisp to participate. The main theme of the 2012 European Lisp Conference is "Interoperabilty: Systems, Libraries, Workflows". Lisp based and functional-languages based systems have grown a variety of solutions to become more and more integrated with the wider world of Information and Communication Technologies in current use. There are several dimensions to the scope of the solutions proposed, ranging from "embedding" of interpreters in C-based systems, to the development of abstractions levels that facilitate the expression of complex context dependent tasks, to the construction of exchange formats handling libraries, to the construction of theorem-provers for the "Semantic Web". The European Lisp Symposium 2012 solicits the submission of papers with this specific theme in mind, alongside the more traditional tracks which have appeared in the past editions. We invite submissions in the following forms: Papers: Technical papers of up to 15 pages that describe original results or explain known ideas in new and elegant ways. Demonstrations: Abstracts of up to 4 pages for demonstrations of tools, libraries, and applications. Tutorials: Abstracts of up to 4 pages for in-depth presentations about topics of special interest for at least 90 minutes and up to 180 minutes. Lightning talks: Abstracts of up to one page for talks to last for no more than 5 minutes. All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates and http://www.acm.org/about/class/1998. Important dates: Jan 31st 2012: submission deadline Feb 21st 2012: acceptance results April 30th, 2012 Conference opens Program Commitee. Chair: Marco Antoniotti, Università degli Studi di Milano Bicocca, Milan, ITALY Local organizers: Damir Ćavar, Eastern Michigan University Franjo Pehar, University of Zadar Damir Kero, University of Zadar Members: Giuseppe Attardi, Università degli Studi di Pisa, Pisa, ITALY Pascal Costanza, Intel, Bruxelles, BELGIUM Marc Feeley, Université de Montreal, Montreal, CANADA Scott McKay, Google, U.S.A. Kent Pitman, U.S.A. Christophe Rhodes, Department of Computing, Goldsmiths, University of London, London, UNITED KINGDOM Robert Strandh, LABRI, Université de Bordeaux, Bordaux, FRANCE Didier Verna, EPITA / LRDE, FRANCE Taiichi Yuasa, Kyoto University, JAPAN

1 0

[cl-unification-devel] [ELS 2012] European Lisp Symposium 2012, Zadar, Croatia; call for papers
by Marco Antoniotti 17 Nov '11

17 Nov '11

Apologies for the multiple postings.... ================================================================ European Lisp Symposium 2012, Zadar, Croatia, April 30th - May 1st, 2012 http://european-lisp-symposium.org The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp and Lisp-inspired dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, and so on. We encourage everyone interested in Lisp to participate. The main theme of the 2012 European Lisp Conference is "Interoperabilty: Systems, Libraries, Workflows". Lisp based and functional-languages based systems have grown a variety of solutions to become more and more integrated with the wider world of Information and Communication Technologies in current use. There are several dimensions to the scope of the solutions proposed, ranging from "embedding" of interpreters in C-based systems, to the development of abstractions levels that facilitate the expression of complex context dependent tasks, to the construction of exchange formats handling libraries, to the construction of theorem-provers for the "Semantic Web". The European Lisp Symposium 2012 solicits the submission of papers with this specific theme in mind, alongside the more traditional tracks which have appeared in the past editions. We invite submissions in the following forms: Papers: Technical papers of up to 15 pages that describe original results or explain known ideas in new and elegant ways. Demonstrations: Abstracts of up to 4 pages for demonstrations of tools, libraries, and applications. Tutorials: Abstracts of up to 4 pages for in-depth presentations about topics of special interest for at least 90 minutes and up to 180 minutes. Lightning talks: Abstracts of up to one page for talks to last for no more than 5 minutes. All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates and http://www.acm.org/about/class/1998. Important dates: Jan 31st 2012: submission deadline Feb 21st 2012: acceptance results April 30th, 2012 Conference opens Program Commitee. Chair: Marco Antoniotti, Università degli Studi di Milano Bicocca, Milan, ITALY Local organizers: • Damir Ćavar, Eastern Michigan University • Franjo Pehar, University of Zadar • Damir Kero, University of Zadar Members: • Giuseppe Attardi, Università degli Studi di Pisa, Pisa, ITALY • Pascal Costanza, Intel, Bruxelles, BELGIUM • Marc Feeley, Université de Montreal, Montreal, CANADA • Scott McKay, Google, U.S.A. • Kent Pitman, Hypermeta, U.S.A. • Christophe Rhodes, Department of Computing, Goldsmiths, University of London, London, UNITED KINGDOM • Robert Strandh, LABRI, Université de Bordeaux, Bordaux, FRANCE • Didier Verna, EPITA / LRDE, FRANCE -- Marco Antoniotti

1 0

[cl-unification-devel] Test
by Marco Antoniotti 20 Sep '11

20 Sep '11

Is this working? -- Marco Antoniotti

2 2

[cl-unification-devel] Test again.
by Marco Antoniotti 15 Sep '11

15 Sep '11

It does not appear to be working..... -- Marco Antoniotti

1 0

[cl-unification-devel] Added nickname to package
by Marco Antoniotti 15 Jun '11

15 Jun '11

Hi I added the "CL-UNIFICATION" nickname to the package. In this way the package can be referred with the same name as the ASDF and MK:DEFSYSTEM systems. Not having this alignment was a mistake carried over from a long time ago... Cheers -- Marco Antoniotti

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

cl-unification-devel