Translating HOL-Light Proofs to Coq
Découvrez la traduction des preuves HOL-Light vers Coq, explorant les défis et solutions pour la vérification formelle entre systèmes logiques différents.
Differential Categories
Explorez les catégories différentielles et leur application en logique linéaire différentielle dans cette conférence mathématique approfondie.
Böhm Trees and Taylor Expansion
Explore Böhm trees and Taylor expansion in lambda calculus, delving into their mathematical properties and applications in differential linear logic.
An Introduction to Differential Linear Logic
Explore Differential Linear Logic fundamentals, key concepts, and applications in this comprehensive introduction by Marie Kerjean at CIRM's mathematical conference.
Monadic and Comonadic Aspects of Dependency Analysis
Explore monadic and comonadic aspects of dependency analysis, unifying calculi into a framework that addresses limitations of existing approaches and provides novel correctness proofs.
A Gradual Probabilistic Lambda Calculus
Explore a gradual probabilistic lambda calculus combining static and dynamic typing for probabilistic programming, enhancing flexibility in machine learning and differential privacy applications.
Type Theory Session Preview - POPL 2023
Explore type theory fundamentals and recent advancements in this expert-led session preview for POPL 2023, enhancing accessibility of upcoming talks.
On the Metatheory of IRs and the CPS-Calculus
Explore the metatheory of IRs and CPS-calculus, examining their foundations, semantics, and applications in compiler optimization and dependently-typed programming languages.
Structural Subtyping as Parametric Polymorphism
Explore the relationship between structural subtyping and parametric polymorphism in programming languages, focusing on their expressive power and potential encodings.
Resource-Aware Soundness for Big-Step Semantics
Explore resource-aware extensions to lambda calculus semantics and type systems, ensuring well-typed programs avoid resource exhaustion through coinductive reasoning and big-step formalization.
Towards Tagless Interpretation of Stratified System F
Explore the design of an intrinsically typed, tagless interpreter for stratified System F in Agda, focusing on advanced type theory concepts and implementation strategies.
Nominal Recursors as Epi-Recursors - POPL 2024
Explore nominal recursors in syntax with bindings, comparing expressiveness and viewing them as epi-recursors. Develop a framework for comparison and apply to nominal corecursors, validated with Isabelle/HOL.
Generating Well-Typed Terms That Are Not "Useless"
Explore a novel algorithm for generating well-typed lambda terms that use their arguments effectively, improving random testing of functional language compilers.
Meaning Representation for Natural Language Understanding - Mariana Romanyshyn - ODSC Europe 2019
Explore abstract meaning representation in NLP, its algorithms, and applications. Learn about AMR graphs and their potential to enhance question answering, summarization, and text simplification.
Lambda Expressions in Java - Performance and Advanced Applications
Explore lambda expressions in Java, from syntax to performance implications, and discover mind-bending functional programming techniques to solve complex problems using only lambdas.
Making a Computer Turing Complete
Explore Turing completeness, Turing machines, and Lambda calculus, and learn how to make an 8-bit breadboard computer capable of solving any computable problem.
An Alien Lambda Calculus - Exploring Alternative Computational Models
Explore an alien lambda calculus: a thought experiment on alternate physics and philosophies, offering insights into compiler design and functional programming concepts.
Taylor Expansion and Game Semantics - Exploring Isomorphisms in Lambda Calculus
Explore the isomorphism between Taylor expansion of λ-terms and pointer concurrent games interpretation, extending previous results on resource terms and game semantics.
Space-Efficient Polymorphic Gradual Typing, Mostly Parametric - PLDI 2024
Explore space-efficient implementation of gradual typing with mostly parametric polymorphism. Learn about λCmp and λSmp calculi, their properties, and the implications for type-preserving translations.
One-Pass CPS Translation of Dependent Types
Explore type-preserving CPS translation for dependently typed languages, focusing on optimizing techniques to eliminate administrative redexes in the Calculus of Constructions.
Higher Order Bayesian Networks, Exactly - POPL 2024
Explore a higher-order programming language for Bayesian networks, combining advanced techniques from linear logic, intersection types, and rewriting theory for efficient probabilistic modeling and inference.