Dear colleagues,
I'm pleased to announce that the following paper has been accepted at
PADL 2025: The 27th International Symposium on Practical Aspects of Declarative Languages
to be held January in Denver, Colorado.
Type-Checking Heterogeneous Sequences in a Simple Embeddable Type System
Abstract:
Heterogeneously typed sequences are frequently used in dynamically
typed programming languages, but can also be used in statically typed
languages supporting run-time type reflection. Such sequences often
exhibit type patterns such as repetition, alternation, and
optionality. The programmer needs a mechanism to declare or query
adherence to these regular patterns. The theory of finite automata
over finite alphabets was conceived for characterizing patterns in
so-called regular languages, but does not exactly meet this challenge,
because the set of potential elements of the sequences is infinite.
In this article, we present a generalization of regular expressions
called rational type expressions as a means of declaring regular
patterns in heterogeneous sequences. We present procedures for
constructing and manipulating symbolic finite automata, a
generalization of classical finite automata, using a portable, simple,
embeddable, type system. We provide a solution for a certain class of
subtype decidability relations where subtypeness can be ensured by
construction. We demonstrate the generality and portability of the
system by providing implementations in \cl, Clojure, Scala, and
Python.
Dear colleagues,
I'm pleased to announce that the following paper has been accepted at
DocEng 2024, the ACM Symposium on Document Engineering, to be held this
August in San Jose.
* Similarity Problems in Paragraph Justification: An Extension to the
Knuth-Plass Algorithm
** In high quality typography, consecutive lines beginning or ending
with the same word or sequence of characters is considered a defect. We
have implemented an extension to TeX's paragraph justification algorithm
which handles this problem. Experimentation shows that getting rid of
similarities is both worth addressing and achievable. Our extension
automates the detection and avoidance of similarities while leaving the
ultimate decision to the professional typographer, thanks to a new
adjustable cursor. The extension is simple and lightweight, making it a
useful addition to production engines.
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
Dear colleagues,
it is my pleasure to announce that the following paper has been accepted
at TUG 2024, to be held in Prague, this July.
A Large Scale Format Compliance Checker for TeX Font Metrics
As part of ETAP, our experimental typesetting algorithms platform, we
have developed a parser for TeX Font Metrics files. The parser not only
provides a rich ontology of errors, but also a powerful recovery
mechanism, made possible by the underlying programming language's unique
exception handling paradigm.
Because the library reifies exceptions as first class citizens in the
language, and in an object-oriented fashion, it is possible to compile
"(non)compliance reports" for fonts by going as far as possible in the
parsing, even in problematic case.
We have applied this to the current TeXlive distribution, inspecting
almost 80,000 fonts, and discovering near 700 fonts with non-compliance
problems. The result of this work has just been officially integrated
into the TeXlive distribution.
See: https://texlive.info/tfm-validate/
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
Dear colleagues,
it's my pleasure to announce that my paper entitled "The Quickref
Cohort" has been accepted to the 17th European Lisp Symposium, May 2-7,
Vienna.
The abstract is given below.
The internal architecture of Declt, our reference manual generator for
Common Lisp libraries, is currently evolving towards a three-stage
pipeline in which the information gathered for documentation purposes is
first reified into a formalized set of object-oriented data structures.
A side-effect of this evolution is the ability to dump that information
for other purposes than documentation. We demonstrate this ability
applied to the complete Quicklisp ecosystem. The resulting "cohort"
includes more than half a million programmatic definitions, and can be
used to gain insight into the morphology of Common Lisp software.
--
Resistance is futile. You will be jazzimilated.
Jazz site: http://www.didierverna.com
Other sites: http://www.didierverna.info
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
17th European Lisp Symposium
Call for Papers
May 6-7 2024
Federal Computing Center, Vienna, Austria
https://www.european-lisp-symposium.org/2024
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Important Dates
~~~~~~~~~~~~~~~
- Submission deadline: Feb. 25 2024 ** EXTENDED **
- Author notification: Mar. 24 2024
- Final papers due: Apr. 14 2024
- Symposium: May 6-7 2024
Scope
~~~~~
The European Lisp Symposium is a premier forum for the discussion and
dissemination of all aspects of design, implementation, and application
of any of the Lisp dialects, including Common Lisp, Scheme, Emacs
Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen,
Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage
everyone interested in Lisp to participate.
The European Lisp Symposium invites high quality papers about novel
research results, insights and lessons learned from practical
applications, and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
Topics include but are not limited to:
- context-, aspect-, domain-oriented and generative programming
- macro-, reflective-, meta- and/or rule-based development approaches
- language design and implementation
- language integration, inter-operation, and deployment
- development methodologies, support, and environments
- educational approaches and perspectives
- experience reports and case studies
This year, we suggest an emphasis on best practices, approaches,
and technologies for building highly recursive and self-adapting
architectures, in particular for AI, ML, tool integration and
instruction generation, using dynamic programming languages.
Technical Program
~~~~~~~~~~~~~~~~~
We invite submissions in the following forms.
* Papers: technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
* Experience reports: papers of up to 6 pages describing a successful
use of a Lisp dialect and/or analyzing obstacles that have kept it
from working in practice.
* Tutorials: abstracts of up to 4 pages for in-depth presentations
about topics of special interest.
* Demonstrations: abstracts of up to 4 pages for demonstrations of
tools, libraries, and applications.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
link http://www.easychair.org/conferences/?conf=els2024.
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Programme Chair
~~~~~~~~~~~~~~~
Giuseppe Attardi, University of Pisa, Italy
Organizing Chair
~~~~~~~~~~~~~~~~
Didier Verna, EPITA, France
Programme Committee
~~~~~~~~~~~~~~~~~~~
Ambrose Bonnaire-Sergeant, Untypable LLC
Frederic Peschanski, UPMC/LIP6
Jay McCarthy, UMass Lowell
Jim Newton, EPITA Research Lab
Kai Selgrad, OTH Regensburg
Mark Evenson, not.org
Michael Raskin, LaBRI/CNRS UMR 5800, University of Bordeaux
Robert Smith, HRL Laboratories LLC
Robert P. Goldman, SIFT LLC
Stefan Monnier, Université de Montréal
Local Chair
~~~~~~~~~~~
Philipp Marek, BRZ, Vienna, Austria
Virtualization Team
~~~~~~~~~~~~~~~~~~~
Georgiy Tugai, Configura, Sweden
Michal Herda, Poland
Yukari Hafner, Shirakumo.org, Switzerland
--
Resistance is futile. You will be jazzimilated.
Jazz site: http://www.didierverna.com
Other sites: http://www.didierverna.info
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
17th European Lisp Symposium
Call for Papers
May 6-7 2024
Federal Computing Center, Vienna, Austria
https://www.european-lisp-symposium.org/2024
Sponsored by EPITA
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Important Dates
~~~~~~~~~~~~~~~
- Submission deadline: Feb. 18 2024
- Author notification: Mar. 24 2024
- Final papers due: Apr. 14 2024
- Symposium: May 6-7 2024
Scope
~~~~~
The European Lisp Symposium is a premier forum for the discussion and
dissemination of all aspects of design, implementation, and application
of any of the Lisp dialects, including Common Lisp, Scheme, Emacs
Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen,
Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage
everyone interested in Lisp to participate.
The European Lisp Symposium invites high quality papers about novel
research results, insights and lessons learned from practical
applications, and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
Topics include but are not limited to:
- context-, aspect-, domain-oriented and generative programming
- macro-, reflective-, meta- and/or rule-based development approaches
- language design and implementation
- language integration, inter-operation, and deployment
- development methodologies, support, and environments
- educational approaches and perspectives
- experience reports and case studies
This year, we suggest an emphasis on best practices, approaches,
and technologies for building highly recursive and self-adapting
architectures, in particular for AI, ML, tool integration and
instruction generation, using dynamic programming languages.
Technical Program
~~~~~~~~~~~~~~~~~
We invite submissions in the following forms.
* Papers: technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
* Experience reports: papers of up to 6 pages describing a successful
use of a Lisp dialect and/or analyzing obstacles that have kept it
from working in practice.
* Tutorials: abstracts of up to 4 pages for in-depth presentations
about topics of special interest.
* Demonstrations: abstracts of up to 4 pages for demonstrations of
tools, libraries, and applications.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
link http://www.easychair.org/conferences/?conf=els2024.
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Programme Chair
~~~~~~~~~~~~~~~
Giuseppe Attardi, University of Pisa, Italy
Programme Committee
~~~~~~~~~~~~~~~~~~~
Ambrose Bonnaire-Sergeant, Untypable LLC
Frederic Peschanski, UPMC/LIP6
Jay McCarthy, UMass Lowell
Jim Newton, EPITA Research Lab
Kai Selgrad, OTH Regensburg
Mark Evenson, not.org
Michael Raskin, LaBRI/CNRS UMR 5800, University of Bordeaux
Robert Smith, HRL Laboratories LLC
Robert P. Goldman, SIFT LLC
Stefan Monnier, Université de Montréal
Local Chair
~~~~~~~~~~~
Philipp Marek, BRZ, Vienna, Austria
Virtualization Team
~~~~~~~~~~~~~~~~~~~
Georgiy Tugai, Configura, Sweden
Michał Herda, Poland
Yukari Hafner, Shirakumo.org, Switzerland
--
Resistance is futile. You will be jazzimilated.
Jazz site: http://www.didierverna.com
Other sites: http://www.didierverna.info
Chers tous,
j'ai le plaisir de vous annoncer une visioconférence en français sur le
« Knuth-Plass », l'algorithme de mise en forme / justification de
paragraphes de TeX. Cette conférence aura lieu le 11 Janvier 2024 à 20h,
dans le cadre des exposés mensuels de l'association GUTenberg.
La page d'annonce avec le résumé est disponible à cette adresse:
https://www.gutenberg-asso.fr/11-janvier-2024-Expose-sur-l-algorithme-de-Kn…
Au plaisir de vous y télé-retrouver...
--
Resistance is futile. You will be jazzimilated.
Other sites: http://www.didierverna.info
Bonjour,
J'ai le plaisir de vous inviter à la soutenance de ma thèse intitulée :
"Contributions au Bounded model-checking basé sur SAT
La soutenance sera présentée en français.
Elle aura lieu le mardi 19 décembre 2023 à partir de 10h00 (heure de
Paris),
en Amphi 401, EPITA, 14-16 Rue Voltaire, 94270 Le Kremlin-Bicêtre.
Vous êtes cordialement invité au pot qui suivra.
Composition du jury:
Rapporteur: Vijay Ganesh, Professeur, GT, Georgia Institute of
Technology.
Rapporteur: Ahmed Bounekkar, Maître de Conférences, ERIC,
Université Claude Bernard Lyon 1.
Examinatrice: Laure Petrucci, Professeure, LIPN, Université Sorbonne
Paris Nord.
Examinatrice: Emmannuelle Encrenaz, Professeure, LIP6, Sorbonne
Université.
Directeur: Souheib Baarir, Enseignant-Chercheur, LRE, EPITA.
Encadrant: Étienne Renault, SiPearl.
Résumé :
Les systèmes informatiques sont devenus omniprésents dans notre vie
quotidienne. Garantir la fiabilité
et la robustesse de ces systèmes est une nécessité absolue. La
Vérification de Modèles (Model Checking)
est l'une des approches dédiées à cette fin. Son objectif est de prouver
l'absence de défaillances ou
d'identifier d'éventuelles erreurs.
Le model checking se décline en plusieurs techniques. Parmi celles-ci,
on trouve la Vérification de
Modèles Bornée (Bounded Model Checking - BMC), une technique qui repose
sur la satisfiabilité
booléenne (SAT). L'idée centrale derrière le BMC est de vérifier qu'un
modèle, limité à des exécutions
bornées par un entier k, satisfait sa spécification, définie comme un
ensemble d'expressions logiques
temporelles. Dans cette approche, les comportements du système sont
exprimés sous forme de problèmes SAT.
Contrairement à d'autres méthodes de vérification formelle, le BMC basé
sur SAT n'est généralement pas
sensible au problème de l'explosion de l'espace d'états, ce qui peut
poser problème lors de la conception
de systèmes impliquant des millions de variables et de contraintes.
Cependant, le compromis réside dans
la complexité temporelle, car les problèmes SAT sont connus pour être
NP-complets.
Au cours des dernières décennies, d'importantes avancées ont été
réalisées dans la résolution séquentielle
de problèmes SAT. Ces développements se sont principalement concentrés
sur l'utilisation d'informations
dynamiques, acquises lors du processus de résolution (par exemple,
l'apprentissage de clauses binaires) ou
d'informations statiques, extraites de la structure inhérente du
problème SAT (par exemple, la structure
en communauté). Toutefois, moins d'attention a été accordée aux
informations structurelles du problème
initial. Par exemple, lorsque qu'un problème BMC est réduit à une
formule booléenne, des données
cruciales sont perdues lors de la traduction. Comme le souligne cette
thèse, la réintégration de ces
informations perdues peut considérablement améliorer le processus de
résolution. Ce travail explore des
moyens d'améliorer la résolution de problèmes BMC basés sur SAT, tant
dans des contextes séquentiels que
parallèles, en exploitant et en valorisant les informations pertinentes
extraites des caractéristiques
inhérentes du problème. Cela peut impliquer l'amélioration
d'heuristiques génériques existantes ou la
décomposition efficace de la formule en partitions.
Cordialement,
Anissa Kheireddine
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
17th European Lisp Symposium
Call for Papers
May 6-7 2024
Federal Computing Center, Vienna, Austria
https://www.european-lisp-symposium.org/2024
Sponsored by EPITA
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Important Dates
~~~~~~~~~~~~~~~
- Submission deadline: Feb. 2 2024
- Author notification: Mar. 24 2024
- Final papers due: Apr. 14 2024
- Symposium: May 6-7 2024
Scope
~~~~~
The European Lisp Symposium is a premier forum for the discussion and
dissemination of all aspects of design, implementation, and application
of any of the Lisp dialects, including Common Lisp, Scheme, Emacs
Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen,
Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage
everyone interested in Lisp to participate.
The European Lisp Symposium invites high quality papers about novel
research results, insights and lessons learned from practical
applications, and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
Topics include but are not limited to:
- context-, aspect-, domain-oriented and generative programming
- macro-, reflective-, meta- and/or rule-based development approaches
- language design and implementation
- language integration, inter-operation, and deployment
- development methodologies, support, and environments
- educational approaches and perspectives
- experience reports and case studies
This year, we suggest an emphasis on best practices, approaches,
and technologies for building highly recursive and self-adapting
architectures, in particular for AI, ML, tool integration and
instruction generation, using dynamic programming languages.
Technical Program
~~~~~~~~~~~~~~~~~
We invite submissions in the following forms.
* Papers: technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
* Experience reports: papers of up to 6 pages describing a successful
use of a Lisp dialect and/or analyzing obstacles that have kept it
from working in practice.
* Tutorials: abstracts of up to 4 pages for in-depth presentations
about topics of special interest.
* Demonstrations: abstracts of up to 4 pages for demonstrations of
tools, libraries, and applications.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
link http://www.easychair.org/conferences/?conf=els2024.
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Programme Chair
~~~~~~~~~~~~~~~
Giuseppe Attardi, University of Pisa, Italy
Local Chair
~~~~~~~~~~~
Philipp Marek, BRZ, Vienna, Austria
Virtualization Team
~~~~~~~~~~~~~~~~~~~
Georgiy Tugai, Configura, Sweden
Michał Herda, Poland
Yukari Hafner, Shirakumo.org, Switzerland
--
Resistance is futile. You will be jazzimilated.
Jazz site: http://www.didierverna.com
Other sites: http://www.didierverna.info
