output
19992026
most citedRobots that can adapt like animals

963 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.PLShow all

18 papers · 1 filter

cs.PL2026

Hybrid Path-Sums for Hybrid Quantum Programs

Christophe Chareton, Jad Issa, Mathieu Nguyen +2

As quantum computing becomes an emerging reality, designing efficient quantum programming capabilities is becoming more and more important. Particularly, the debugging and validati…

cs.PL2025★ 1 cited

Destination Calculus: A Linear λ-Calculus for Purely Functional Memory Writes

Thomas Bagrel, Arnaud Spiwack

Destination passing -- aka. out parameters -- is taking a parameter to fill rather than returning a result from a function. Due to its apparently imperative nature, destination pas…

cs.PL2024

Omega: The Power of Visual Simplicity

Benoit Sonntag, Dominique Colnet

We are currently developing an innovative and visually-driven programming language called Omega.Although the Omega code is stored in text files, these files are not intended for ma…

cs.PL2023

Destination-passing style programming: a Haskell implementation

Thomas Bagrel

Destination-passing style programming introduces destinations, which represent the address of a write-once memory cell. Those destinations can be passed as function parameters, and…

cs.PL2023★ 3 cited

Exploiting array manipulation habits to optimize garbage collection and type flow analysis

Dominique Colnet, Benoît Sonntag

A widespread practice to implement a flexible array is to consider the storage area into two parts: the used area, which is already available for read/write operations, and the sup…

cs.PL2022★ 1 cited

LibNDT: Towards a Formal Library on Spreadable Properties over Linked Nested Datatypes

Mathieu Montin, Amélie Ledein, Catherine Dubois

Nested datatypes have been widely studied in the past 25 years, both theoretically using category theory, and practically in programming languages such as Haskell. They consist in…

cs.PL2020★ 3 cited

Generating Distributed Programs from Event-B Models

Horatiu Cirstea, Alexis Grall, Dominique Méry

Distributed algorithms offer challenges in checking that they meet their specifications. Verification techniques can be extended to deal with the verification of safety properties…

cs.PL2019★ 5 cited

LNL-FPC: The Linear/Non-linear Fixpoint Calculus

Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev

We describe a type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus). The type system supports linear typing, which e…

cs.PL2017★ 5 cited

Faithful (meta-)encodings of programmable strategies into term rewriting systems

Horatiu Cirstea, Serguei Lenglet, Pierre-Etienne Moreau

Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transfor…

cs.PL2017

Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation

Horatiu Cirstea, Santiago Escobar

This volume contains the formal proceedings of the Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2016), held on 23rd June 20…

cs.PL2015★ 1 cited

Proceedings 8th Interaction and Concurrency Experience

Sophia Knight, Ivan Lanese, Alberto Lluch Lafuente +1

This volume contains the proceedings of ICE 2015, the 8th Interaction and Concurrency Experience, which was held in Grenoble, France on the 4th and 5th of June 2015 as a satellite…

cs.PL2014

Analyzing Conflict Freedom For Multi-threaded Programs With Time Annotations

Jingshu Chen, Marie Duflot, Stephan Merz

Avoiding access conflicts is a major challenge in the design of multi-threaded programs. In the context of real-time systems, the absence of conflicts can be guaranteed by ensuring…

cs.PL2013

Environmental Bisimulations for Delimited-Control Operators

Dariusz Biernacki, Sergueï Lenglet

We present a theory of environmental bisimilarity for the delimited-control operators {\it shift} and {\it reset}. We consider two different notions of contextual equivalence: one…

cs.PL2013★ 2 cited

Proving termination of evaluation for System F with control operators

Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet +1

We present new proofs of termination of evaluation in reduction semantics (i.e., a small-step operational semantics with explicit representation of evaluation contexts) for System…

cs.PL2009★ 2 cited

jYang : A YANG parser in java

Emmanuel Nataf, Olivier Festor

The NETCONF configuration protocol of the IETF Network Work- ing Group provides mechanisms to manipulate the configuration of network devices. YANG is the language currently under…

cs.PL2007

Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - Report on the Workshop ICOOOLPS'2007 at ECOOP'07

Olivier Zendra, Eric Jul, Roland Ducournau +5

ICOOOLPS'2007 was the second edition of the ECOOP-ICOOOLPS workshop. ICOOOLPS intends to bring researchers and practitioners both from academia and industry together, with a spirit…

cs.PL2006★ 1 cited

Memory and compiler optimizations for low-power and -energy

Olivier Zendra

Embedded systems become more and more widespread, especially autonomous ones, and clearly tend to be ubiquitous. In such systems, low-power and low-energy usage get ever more cruci…

cs.PL2006★ 1 cited

Canonical Abstract Syntax Trees

Antoine Reilles

This paper presents Gom, a language for describing abstract syntax trees and generating a Java implementation for those trees. Gom includes features allowing the user to specify an…