◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Laboratoire d'Algorithmique, Complexité et Logique

7 papers here83 citations across 7
fields
  • cs.LO3
  • cs.CC1
  • cs.CR1
  • cs.FL1
  • math.LO1
ROR 05bdn0q71OpenAlex

affiliations via OpenAlex

output
20062011
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations

researchers with a paper here
  • Emmanuel Polonowski2 · h 6
  • Sergey Verlan2 profiles2 · h 22
  • Cătălin Dima1
  • Danièle Beauquier1 · h 1
  • Denis Richard1 · h 9
  • Ferucio Laurenţiu Ţiplea1
  • Frédéric Gauche1 · h 2
  • Ion Petre1
  • M. Vsemirnov1 · h 11
  • P. Cégielski1 · h 8
  • T. Crolard1 · h 8
  • Yurii Rogozhin1 · h 18
collaborating institutions
  • Åbo Akademi UniversityFI1 paper
  • Département d'InformatiqueFR1 paper
  • Institute of Mathematics and Computer ScienceMD1 paper
Showing 2009 · cs.LOShow all

2 papers · 2 filters

cs.LO2009

A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables

Tristan Crolard, Emmanuel Polonowski

We formally specified the type system and operational semantics of LOOPw with Ott and Isabelle/HOL proof assistant. Moreover, both the type system and the semantics of LOOPw have b…

cs.LO2009

Deriving SN from PSN: a general proof technique

Emmanuel Polonowski

In the framework of explicit substitutions there is two termination properties: preservation of strong normalization (PSN), and strong normalization (SN). Since there are not easil…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.