Información de la conferencia

POPL 2027: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages

Por favor Iniciar sesión para ver el sitio web de la conferencia
Cuenta gratuita: consulta los sitios oficiales, sigue las fechas límite y recibe recordatorios por correo.
Iniciar sesión Registrarse
Insertar insignia de cuenta atrás
POPL
Día de Entrega:
2026-07-09 Faltan 5 días
Fecha de Notificación:
2026-10-05
Fecha de conferencia:
2027-01-10
Ubicación:
Mexico City, Mexico
Ediciones:
54
CCF: A   ICORE: A*   QUALIS: A1   Vistas: 102219   Seguidores: 52   Asistentes: 4

Solicitud de Artículos

POPL 2027 (ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages) is a CCF A / ICORE A* / QUALIS A1 conference held in Mexico City, Mexico on 2027-01-10. The paper submission deadline is 2026-07-09. Acceptance notifications are sent on 2026-10-05.

Scope Principles of Programming Languages (POPL) is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation, or application of programming languages. Evaluation Criteria The Review Committee (aka Program Committee, PC) will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity. Each paper must explain its scientific contribution in both general and technical terms, identifying what has been accomplished, explaining why it is significant and comparing it with previous work. Advice on writing technical papers can be found on the SIGPLAN author information page. Deadlines and formatting requirements, detailed below, will be strictly enforced. Double-Blind Reviewing POPL 2027 will use a full double-blind reviewing process (similar to the one used in recent years (POPL 2023 - 2026) but different from the lightweight double-blind process used before then). This means that identities of authors will not be made visible to reviewers until after conditional-acceptance decisions have been made, and then only for the conditionally-accepted papers. The use of full double-blind reviewing has several consequences for authors. Submissions: Authors must omit their names and institutions from their paper submissions. In addition, references to authors’ own prior work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). Supplementary material: Authors are permitted to provide supplementary material (e.g., detailed proofs, proof scripts, system implementations, or experimental data) along with their submission, which reviewers may (but are not required to) examine. This material may take the form of a single file, such as a PDF or a tarball. Authors must fully anonymize any supplementary material, and there is no option to submit non-anonymized material. Author response: In responding to reviews, authors should not say anything that reveals their identity, since author identities will not be revealed to reviewers at that stage of the reviewing process. Dissemination of work under submission: Authors are welcome to disseminate their ideas and post draft versions of their paper(s) on their personal website, institutional repository, or arXiv (reviewers will be asked to turn off arXiv notifications during the review period). But authors should not take steps that would almost certainly reveal their identities to members of the Review Committee, e.g., directly contacting PC members or publicizing the work on widely-visible social media or major mailing lists used by the community. The purpose of the above restrictions is to help the Review Committee and external reviewers come to a judgment about the paper without bias, not to make it impossible for them to discover the authors’ identities if they were to try. In particular, nothing should be done in the name of anonymity that weakens the quality of the submission. However, there are occasionally cases where adhering to the above restrictions is truly difficult or impossible for one reason or another. In such cases, the authors should contact the Program Chair to discuss the situation and how to handle it. The FAQ on Double-Blind Reviewing addresses many common scenarios and answers many common questions about this topic. But there remain many grey areas and trade-offs. If you have any doubts about how to interpret the double-blind rules or you encounter a complex case that is not clearly covered by the FAQ, please contact the Program Chair for guidance.
Última actualización por Dou Sun el

Tasa de aceptación

Tasa de aceptación media: 19% en 14 años (1996–2009).

AñoEnviadosAceptadosAceptados(%)
20091603622.5%
20082123516.5%
20071983618.2%
20061673319.8%
20051723118%
20041762916.5%
20031262419%
20021282821.9%
20011262419%
20001513019.9%
19991362417.6%
19981753117.7%
19972253616%
19961483423%

Los Mejores Artículos

AñoLos Mejores Artículos
2025A Primal-Dual Perspective on Program Verification Algorithms
2025Data Race Freedom à la Mode
2025Affect: An Affine Type and Effect System
2025Barendregt Convenes with Knaster and Tarski: Strong Rule Induction for Syntax with Bindings
2025TensorRight: Automated Verification of Tensor Graph Rewrites
2025Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
2025Relaxed Memory Concurrency Re-executed
2024An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
2024Automatic Parallelism Management
2024Soundly Handling Linearity
2024Total Type Error Localization and Recovery with Holes
2024Flan: An Expressive and Efficient Datalog Compiler for Program Analysis
2024Parametric Subtyping for Structural Parametric Polymorphism
2024Nominal Recursors as Epi-Recursors
2024Modular Denotational Semantics for Effects with Guarded Interaction Trees
2022Bottom-up synthesis of recursive functional programs using angelic execution
2022One polynomial approximation to produce correctly rounded results of an elementary function for multiple representations and rounding modes
2022Observational equality: now for good
2022Learning formulas in finite variable logics
2022Formal metatheory of second-order abstract syntax
2022Pirouette: higher-order typed functional choreographies
1997Proof-Carrying Code
1996Points-to Analysis in Almost Linear Time
1993Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects
1977Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints

Las personas que vieron esto también vieron

CCFICOREAbreviaciónNombre CompletoEntregaNotificaciónFecha de conferencia
BAICSOCInternational Conference on Service Oriented Computing2026-07-052026-09-132026-12-01
BSOCCACM Symposium on Cloud Computing2026-07-072026-09-262026-11-18
AA*FSEACM SIGSOFT Symposium on the Foundations of Software Engineering2026-10-022027-03-312027-07-12
AA*ICSEInternational Conference on Software Engineering2026-06-232026-10-202027-04-25
AA*NDSSAnnual Network & Distributed System Security Symposium2026-08-192026-11-042027-03-22
AAEuroSysEuropean Conference on Computer Systems2026-09-172027-01-292027-04-19
AA*ASPLOSInternational Conference on Architectural Support for Programming Languages and Operating Systems2026-09-092026-12-212027-03-22
AA*AAAIAAAI Conference on Artificial Intelligence2026-07-212026-11-302027-02-16
BBIBMInternational Conference on Bioinformatics & Biomedicine2026-07-052026-09-252026-12-01
AA*KDDACM SIGKDD Conference on Knowledge Discovery and Data Mining2026-07-192026-11-142027-08-09

Conferencias Relacionadas

Revistas Relacionadas

Comentarios 0

Aún no hay comentarios.

Por favor Iniciar sesión para publicar un comentario