ICFP 2021
Sun 22 - Sat 28 August 2021
Toggle navigation
Attending
Venue: Virtual
Student Volunteers
Code of Conduct
Call For Sponsorship
Registration
Accessibility
Program
ICFP Program
Your Program
Filter by Day
Sun 22 Aug
Mon 23 Aug
Tue 24 Aug
Wed 25 Aug
Thu 26 Aug
Fri 27 Aug
Sat 28 Aug
Tracks
ICFP 2021
JFP Talks
PLTea
Research Papers
Social Events
Artifact Evaluation
Student Research Competition
Workshops
Tutorials
ICFP Programming Contest
Student Volunteers
Workshops
Erlang
Erlang
- Fifteen Years of Successfully Dialyzing Erlang and Elixir Code (Keynote)
FARM
FHPNC
HIW
HOPE
ML
OCaml
PLMW @ ICFP
Scheme
TyDe
miniKanren
Co-hosted Symposia
Haskell
Organization
ICFP 2021 Committees
Organizing Committee
Steering Committee
Virtualization Committee
Track Committees
PLTea
Research Papers
Student Research Competition
Tutorials
Student Volunteers
Contributors
People Index
Workshops
Erlang
Organizing Committee
Program Committee
FARM
Organizing Committee
Program Committee
FHPNC
Organizing Committee
Program Committee
HIW
Program Committee
HOPE
Program Committee
ML
Organizing Committee
Program Committee
OCaml
Organizing Committee
Program Committee
PLMW @ ICFP
Organizing Committee
Scheme
Organizing Committee
Program Committee
TyDe
Program Committee
miniKanren
Organizing Committee
Program Committee
Co-hosted Symposia
Haskell
Program Committee
Search
Series
Series
ICFP 2025
ICFP 2024
ICFP 2023
ICFP 2022
ICFP 2021
ICFP 2020
ICFP 2019
ICFP 2018
ICFP 2017
ICFP 2016
Sign in
Sign up
ICFP 2021
(
series
) /
Virtual
/
Room information: ICFP Q&A
Venue
Virtual
Room name
ICFP Q&A
Room Information
No extra information available
Program
Detailed Table
Session Timeline
Detailed Timeline
Program Display Configuration
Time Zone
The program is currently displayed in
(GMT+09:00) Seoul
.
Use conference time zone: (GMT+09:00) Seoul
Select other time zone
(GMT-12:00) AoE (Anywhere On Earth)
(GMT-11:00) Midway Island, Samoa
(GMT-09:00) Hawaii-Aleutian
(GMT-10:00) Hawaii
(GMT-09:30) Marquesas Islands
(GMT-09:00) Gambier Islands
(GMT-08:00) Alaska
(GMT-07:00) Tijuana, Baja California
(GMT-08:00) Pitcairn Islands
(GMT-07:00) Pacific Time (US & Canada)
(GMT-06:00) Mountain Time (US & Canada)
(GMT-06:00) Chihuahua, La Paz, Mazatlan
(GMT-07:00) Arizona
(GMT-06:00) Saskatchewan, Central America
(GMT-05:00) Guadalajara, Mexico City, Monterrey
(GMT-06:00) Easter Island
(GMT-05:00) Central Time (US & Canada)
(GMT-04:00) Eastern Time (US & Canada)
(GMT-04:00) Cuba
(GMT-05:00) Bogota, Lima, Quito, Rio Branco
(GMT-04:00) Caracas
(GMT-04:00) Santiago
(GMT-04:00) La Paz
(GMT-03:00) Faukland Islands
(GMT-04:00) Manaus, Amazonas, Brazil
(GMT-03:00) Atlantic Time (Goose Bay)
(GMT-03:00) Atlantic Time (Canada)
(GMT-02:30) Newfoundland
(GMT-03:00) UTC-3
(GMT-03:00) Montevideo
(GMT-02:00) Miquelon, St. Pierre
(GMT-02:00) Greenland
(GMT-03:00) Buenos Aires
(GMT-03:00) Brasilia, Distrito Federal, Brazil
(GMT-02:00) Mid-Atlantic
(GMT-01:00) Cape Verde Is.
(GMT) Azores
(UTC) Coordinated Universal Time
(GMT+01:00) Belfast
(GMT+01:00) Dublin
(GMT+01:00) Lisbon
(GMT+01:00) London
(GMT) Monrovia, Reykjavik
(GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna
(GMT+02:00) Belgrade, Bratislava, Budapest, Ljubljana, Prague
(GMT+02:00) Brussels, Copenhagen, Madrid, Paris
(GMT+01:00) West Central Africa
(GMT+02:00) Windhoek
(GMT+03:00) Athens
(GMT+03:00) Beirut
(GMT+02:00) Cairo
(GMT+03:00) Gaza
(GMT+02:00) Harare, Pretoria
(GMT+03:00) Jerusalem
(GMT+03:00) Minsk
(GMT+03:00) Syria
(GMT+03:00) Moscow, St. Petersburg, Volgograd
(GMT+03:00) Nairobi
(GMT+04:30) Tehran
(GMT+04:00) Abu Dhabi, Muscat
(GMT+04:00) Yerevan
(GMT+04:30) Kabul
(GMT+05:00) Ekaterinburg
(GMT+05:00) Tashkent
(GMT+05:30) Chennai, Kolkata, Mumbai, New Delhi
(GMT+05:45) Kathmandu
(GMT+06:00) Astana, Dhaka
(GMT+07:00) Novosibirsk
(GMT+06:30) Yangon (Rangoon)
(GMT+07:00) Bangkok, Hanoi, Jakarta
(GMT+07:00) Krasnoyarsk
(GMT+08:00) Beijing, Chongqing, Hong Kong, Urumqi
(GMT+08:00) Irkutsk, Ulaan Bataar
(GMT+08:00) Perth
(GMT+08:45) Eucla
(GMT+09:00) Osaka, Sapporo, Tokyo
(GMT+09:00) Seoul
(GMT+09:00) Yakutsk
(GMT+09:30) Adelaide
(GMT+09:30) Darwin
(GMT+10:00) Brisbane
(GMT+10:00) Hobart
(GMT+10:00) Vladivostok
(GMT+10:30) Lord Howe Island
(GMT+11:00) Solomon Is., New Caledonia
(GMT+11:00) Magadan
(GMT+11:00) Norfolk Island
(GMT+12:00) Anadyr, Kamchatka
(GMT+12:00) Auckland, Wellington
(GMT+12:00) Fiji, Kamchatka, Marshall Is.
(GMT+12:45) Chatham Islands
(GMT+13:00) Nuku'alofa
(GMT+14:00) Kiritimati
The GMT offsets shown reflect the offsets
at the moment of the conference
.
Time Band
By setting a time band, the program will dim events that are outside this time window. This is useful for (virtual) conferences with a continuous program (with repeated sessions).
The time band will also limit the events that are included in the personal iCalendar subscription service.
Display full program
Specify a time band
-
Save
×
You're viewing the program in a time zone which is different from your device's time zone
change time zone
Mon 23 Aug
Displayed time zone:
Seoul
change
16:15 - 17:45
Q&A 1
Research Papers
at
ICFP Q&A
+12h
16:15
15m
Live Q&A
Q&A: Client-Server Sessions in Linear Logic
Mirror
Research Papers
16:30
15m
Live Q&A
Q&A: An Order-Aware Dataflow Model for Parallel Unix Pipelines
Both
Research Papers
16:45
15m
Live Q&A
Q&A: CPS Transformation with Affine Types for Call-By-Value Implicit Polymorphism
Both
Research Papers
17:00
15m
Live Q&A
Q&A: Getting to the Point: Index Sets and Parallelism-Preserving Autodiff for Pointful Array Programming
Both
Research Papers
17:15
15m
Live Q&A
Q&A: Propositions-as-Types and Shared State
Both
Research Papers
17:30
15m
Live Q&A
Q&A: Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations
Both
Research Papers
19:15 - 21:00
Q&A 2
Research Papers
at
ICFP Q&A
+12h
19:15
15m
Live Q&A
Q&A: Contextual Modal Types for Algebraic Effects and Handlers
Both
Research Papers
19:30
15m
Live Q&A
Q&A: Calculating Dependently-Typed Compilers (Functional Pearl)
Main
Research Papers
19:45
15m
Live Q&A
Q&A: Reasoning about Effect Interaction by Fusion
Main
Research Papers
20:00
15m
Live Q&A
Q&A: Compositional Optimizations for CertiCoq
Main
Research Papers
20:15
15m
Live Q&A
Q&A: Generalized Evidence Passing for Effect Handlers
Mirror
Research Papers
20:30
15m
Live Q&A
Q&A: Deriving Efficient Program Transformations from Rewrite Rules
Mirror
Research Papers
20:45
15m
Live Q&A
Q&A: Algebras for Weighted Search
Main
Research Papers
Tue 24 Aug
Displayed time zone:
Seoul
change
04:15 - 05:45
Q&A 1
Research Papers
at
ICFP Q&A
04:15
15m
Live Q&A
Q&A: Client-Server Sessions in Linear Logic
Mirror
Research Papers
04:30
15m
Live Q&A
Q&A: An Order-Aware Dataflow Model for Parallel Unix Pipelines
Both
Research Papers
04:45
15m
Live Q&A
Q&A: CPS Transformation with Affine Types for Call-By-Value Implicit Polymorphism
Both
Research Papers
05:00
15m
Live Q&A
Q&A: Getting to the Point: Index Sets and Parallelism-Preserving Autodiff for Pointful Array Programming
Both
Research Papers
05:15
15m
Live Q&A
Q&A: Propositions-as-Types and Shared State
Both
Research Papers
05:30
15m
Live Q&A
Q&A: Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations
Both
Research Papers
07:15 - 09:00
Q&A 2
Research Papers
at
ICFP Q&A
07:15
15m
Live Q&A
Q&A: Contextual Modal Types for Algebraic Effects and Handlers
Both
Research Papers
07:30
15m
Live Q&A
Q&A: Calculating Dependently-Typed Compilers (Functional Pearl)
Main
Research Papers
07:45
15m
Live Q&A
Q&A: Reasoning about Effect Interaction by Fusion
Main
Research Papers
08:00
15m
Live Q&A
Q&A: Compositional Optimizations for CertiCoq
Main
Research Papers
08:15
15m
Live Q&A
Q&A: Generalized Evidence Passing for Effect Handlers
Mirror
Research Papers
08:30
15m
Live Q&A
Q&A: Deriving Efficient Program Transformations from Rewrite Rules
Mirror
Research Papers
08:45
15m
Live Q&A
Q&A: Algebras for Weighted Search
Main
Research Papers
16:15 - 17:45
Q&A 3
Research Papers
at
ICFP Q&A
+12h
16:15
15m
Live Q&A
Q&A: Modular, Compositional, and Executable Formal Semantics for LLVM IR
Both
Research Papers
16:30
15m
Live Q&A
Q&A: Higher-Order Probabilistic Adversarial Computations: Categorical Semantics and Program Logics
Both
Research Papers
16:45
15m
Live Q&A
Q&A: How to Evaluate Blame for Gradual Types
Mirror
Research Papers
17:00
15m
Live Q&A
Q&A: ProbNV: Probabilistic Verification of Network Control Planes
Mirror
Research Papers
17:15
15m
Live Q&A
Q&A: Of JavaScript AOT Compilation Performance
Main
Research Papers
17:30
15m
Live Q&A
Q&A: Symbolic and Automatic Differentiation of Languages
Mirror
Research Papers
19:15 - 21:00
Q&A 4
Research Papers
at
ICFP Q&A
+12h
19:15
15m
Live Q&A
Q&A: How to design co-programs (JFP Presentation)
Both
Research Papers
19:30
15m
Live Q&A
Q&A: A Theory of Higher-Order Subtyping with Type Intervals
Both
Research Papers
19:45
15m
Live Q&A
Q&A: Typed dataspace actors (JFP Presentation)
Both
Research Papers
20:00
15m
Live Q&A
Q&A: An Existential Crisis Resolved: Type Inference for First-Class Existential Types
Both
Research Papers
20:15
15m
Live Q&A
Q&A: Proof-directed program transformation: A functional account of efficient regular expression matching (JFP Presentation)
Both
Research Papers
20:30
15m
Live Q&A
Q&A: Distributing Intersection and Union Types with Splits and Duality (Functional Pearl)
Both
Research Papers
20:45
15m
Live Q&A
Q&A: Leibniz equality is isomorphic to Martin-Löf identity, parametrically (JFP Presentation)
Both
Research Papers
Wed 25 Aug
Displayed time zone:
Seoul
change
04:15 - 05:45
Q&A 3
Research Papers
at
ICFP Q&A
04:15
15m
Live Q&A
Q&A: Modular, Compositional, and Executable Formal Semantics for LLVM IR
Both
Research Papers
04:30
15m
Live Q&A
Q&A: Higher-Order Probabilistic Adversarial Computations: Categorical Semantics and Program Logics
Both
Research Papers
04:45
15m
Live Q&A
Q&A: How to Evaluate Blame for Gradual Types
Mirror
Research Papers
05:00
15m
Live Q&A
Q&A: ProbNV: Probabilistic Verification of Network Control Planes
Mirror
Research Papers
05:15
15m
Live Q&A
Q&A: Of JavaScript AOT Compilation Performance
Main
Research Papers
05:30
15m
Live Q&A
Q&A: Symbolic and Automatic Differentiation of Languages
Mirror
Research Papers
07:15 - 09:00
Q&A 4
Research Papers
at
ICFP Q&A
07:15
15m
Live Q&A
Q&A: How to design co-programs (JFP Presentation)
Both
Research Papers
07:30
15m
Live Q&A
Q&A: A Theory of Higher-Order Subtyping with Type Intervals
Both
Research Papers
07:45
15m
Live Q&A
Q&A: Typed dataspace actors (JFP Presentation)
Both
Research Papers
08:00
15m
Live Q&A
Q&A: An Existential Crisis Resolved: Type Inference for First-Class Existential Types
Both
Research Papers
08:15
15m
Live Q&A
Q&A: Proof-directed program transformation: A functional account of efficient regular expression matching (JFP Presentation)
Both
Research Papers
08:30
15m
Live Q&A
Q&A: Distributing Intersection and Union Types with Splits and Duality (Functional Pearl)
Both
Research Papers
08:45
15m
Live Q&A
Q&A: Leibniz equality is isomorphic to Martin-Löf identity, parametrically (JFP Presentation)
Both
Research Papers
16:15 - 17:45
Q&A 5
Research Papers
at
ICFP Q&A
+12h
16:15
15m
Live Q&A
Q&A: On Continuation-Passing Transformations and Expected Cost Analysis
Both
Research Papers
16:30
15m
Live Q&A
Q&A: Steel: Proof-Oriented Programming in a Dependently Typed Concurrent Separation Logic
Both
Research Papers
16:45
15m
Live Q&A
Q&A: Automatic Amortized Resource Analysis with the Quantum Physicist’s Method
Mirror
Research Papers
17:00
15m
Live Q&A
Q&A: Theorems for Free from Separation Logic Specifications
Both
Research Papers
17:15
15m
Live Q&A
Q&A: Reasoning about the Garden of Forking Paths
Both
Research Papers
17:30
15m
Live Q&A
Q&A: Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model
Both
Research Papers
19:15 - 21:00
Q&A 6
Research Papers
at
ICFP Q&A
+12h
19:15
15m
Live Q&A
Q&A: Newly-Single and Loving It: Improving Higher-Order Must-Alias Analysis with Heap Fragments
Mirror
Research Papers
19:30
15m
Live Q&A
Q&A: Grafs: Declarative Graph Analytics
Mirror
Research Papers
19:45
15m
Live Q&A
Q&A: Certifying the Synthesis of Heap-Manipulating Programs
Both
Research Papers
20:00
15m
Live Q&A
Q&A: Skipping the Binder Bureaucracy with Mixed Embeddings in a Semantics Course (Functional Pearl)
Both
Research Papers
20:15
15m
Live Q&A
Q&A: GhostCell: Separating Permissions from Data in Rust
Both
Research Papers
20:30
15m
Live Q&A
Q&A: Catala: A Programming Language for the Law
Both
Research Papers
20:45
15m
Live Q&A
Q&A: Persistent Software Transactional Memory in Haskell
Main
Research Papers
Thu 26 Aug
Displayed time zone:
Seoul
change
04:15 - 05:45
Q&A 5
Research Papers
at
ICFP Q&A
04:15
15m
Live Q&A
Q&A: On Continuation-Passing Transformations and Expected Cost Analysis
Both
Research Papers
04:30
15m
Live Q&A
Q&A: Steel: Proof-Oriented Programming in a Dependently Typed Concurrent Separation Logic
Both
Research Papers
04:45
15m
Live Q&A
Q&A: Automatic Amortized Resource Analysis with the Quantum Physicist’s Method
Mirror
Research Papers
05:00
15m
Live Q&A
Q&A: Theorems for Free from Separation Logic Specifications
Both
Research Papers
05:15
15m
Live Q&A
Q&A: Reasoning about the Garden of Forking Paths
Both
Research Papers
05:30
15m
Live Q&A
Q&A: Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model
Both
Research Papers
07:15 - 09:00
Q&A 6
Research Papers
at
ICFP Q&A
07:15
15m
Live Q&A
Q&A: Newly-Single and Loving It: Improving Higher-Order Must-Alias Analysis with Heap Fragments
Mirror
Research Papers
07:30
15m
Live Q&A
Q&A: Grafs: Declarative Graph Analytics
Mirror
Research Papers
07:45
15m
Live Q&A
Q&A: Certifying the Synthesis of Heap-Manipulating Programs
Both
Research Papers
08:00
15m
Live Q&A
Q&A: Skipping the Binder Bureaucracy with Mixed Embeddings in a Semantics Course (Functional Pearl)
Both
Research Papers
08:15
15m
Live Q&A
Q&A: GhostCell: Separating Permissions from Data in Rust
Both
Research Papers
08:30
15m
Live Q&A
Q&A: Catala: A Programming Language for the Law
Both
Research Papers
08:45
15m
Live Q&A
Q&A: Persistent Software Transactional Memory in Haskell
Main
Research Papers
Mon 23 Aug
Displayed time zone:
Seoul
change
Room
16:00
30
17:00
30
18:00
30
19:00
30
20:00
30
ICFP Q&A
Research Papers
Q&A 1
Research Papers
Q&A 2
Tue 24 Aug
Displayed time zone:
Seoul
change
Room
4:00
30
5:00
30
6:00
30
7:00
30
8:00
30
9:00
30
10:00
30
11:00
30
12:00
30
13:00
30
14:00
30
15:00
30
16:00
30
17:00
30
18:00
30
19:00
30
20:00
30
ICFP Q&A
Research Papers
Q&A 1
Research Papers
Q&A 2
Research Papers
Q&A 3
Research Papers
Q&A 4
Wed 25 Aug
Displayed time zone:
Seoul
change
Room
4:00
30
5:00
30
6:00
30
7:00
30
8:00
30
9:00
30
10:00
30
11:00
30
12:00
30
13:00
30
14:00
30
15:00
30
16:00
30
17:00
30
18:00
30
19:00
30
20:00
30
ICFP Q&A
Research Papers
Q&A 3
Research Papers
Q&A 4
Research Papers
Q&A 5
Research Papers
Q&A 6
Thu 26 Aug
Displayed time zone:
Seoul
change
Room
4:00
30
5:00
30
6:00
30
7:00
30
8:00
30
ICFP Q&A
Research Papers
Q&A 5
Research Papers
Q&A 6
Mon 23 Aug
Displayed time zone:
Seoul
change
Room
16:00
15
30
45
17:00
15
30
45
18:00
15
30
45
19:00
15
30
45
20:00
15
30
45
ICFP Q&A
ICFP Research Papers
Mirror
Q&A: Client-Server Sessions in Linear Logic
16:15 - 16:30
ICFP Research Papers
Both
Q&A: An Order-Aware Dataflow Model for Parallel Unix Pipelines
16:30 - 16:45
ICFP Research Papers
Both
Q&A: CPS Transformation with Affine Types for Call-By-Value Implicit Po ...
16:45 - 17:00
ICFP Research Papers
Both
Q&A: Getting to the Point: Index Sets and Parallelism-Preserving Autodi ...
17:00 - 17:15
ICFP Research Papers
Both
Q&A: Propositions-as-Types and Shared State
17:15 - 17:30
ICFP Research Papers
Both
Q&A: Efficient Tree-Traversals: Reconciling Parallelism and Dense Data ...
17:30 - 17:45
ICFP Research Papers
Both
Q&A: Contextual Modal Types for Algebraic Effects and Handlers
19:15 - 19:30
ICFP Research Papers
Main
Q&A: Calculating Dependently-Typed Compilers (Functional Pearl)
19:30 - 19:45
ICFP Research Papers
Main
Q&A: Reasoning about Effect Interaction by Fusion
19:45 - 20:00
ICFP Research Papers
Main
Q&A: Compositional Optimizations for CertiCoq
20:00 - 20:15
ICFP Research Papers
Mirror
Q&A: Generalized Evidence Passing for Effect Handlers
20:15 - 20:30
ICFP Research Papers
Mirror
Q&A: Deriving Efficient Program Transformations from Rewrite Rules
20:30 - 20:45
ICFP Research Papers
Main
Q&A: Algebras for Weighted Search
20:45 - 21:00
Tue 24 Aug
Displayed time zone:
Seoul
change
Room
4:00
15
30
45
5:00
15
30
45
6:00
15
30
45
7:00
15
30
45
8:00
15
30
45
9:00
15
30
45
10:00
15
30
45
11:00
15
30
45
12:00
15
30
45
13:00
15
30
45
14:00
15
30
45
15:00
15
30
45
16:00
15
30
45
17:00
15
30
45
18:00
15
30
45
19:00
15
30
45
20:00
15
30
45
ICFP Q&A
ICFP Research Papers
Mirror
Q&A: Client-Server Sessions in Linear Logic
04:15 - 04:30
ICFP Research Papers
Both
Q&A: An Order-Aware Dataflow Model for Parallel Unix Pipelines
04:30 - 04:45
ICFP Research Papers
Both
Q&A: CPS Transformation with Affine Types for Call-By-Value Implicit Po ...
04:45 - 05:00
ICFP Research Papers
Both
Q&A: Getting to the Point: Index Sets and Parallelism-Preserving Autodi ...
05:00 - 05:15
ICFP Research Papers
Both
Q&A: Propositions-as-Types and Shared State
05:15 - 05:30
ICFP Research Papers
Both
Q&A: Efficient Tree-Traversals: Reconciling Parallelism and Dense Data ...
05:30 - 05:45
ICFP Research Papers
Both
Q&A: Contextual Modal Types for Algebraic Effects and Handlers
07:15 - 07:30
ICFP Research Papers
Main
Q&A: Calculating Dependently-Typed Compilers (Functional Pearl)
07:30 - 07:45
ICFP Research Papers
Main
Q&A: Reasoning about Effect Interaction by Fusion
07:45 - 08:00
ICFP Research Papers
Main
Q&A: Compositional Optimizations for CertiCoq
08:00 - 08:15
ICFP Research Papers
Mirror
Q&A: Generalized Evidence Passing for Effect Handlers
08:15 - 08:30
ICFP Research Papers
Mirror
Q&A: Deriving Efficient Program Transformations from Rewrite Rules
08:30 - 08:45
ICFP Research Papers
Main
Q&A: Algebras for Weighted Search
08:45 - 09:00
ICFP Research Papers
Both
Q&A: Modular, Compositional, and Executable Formal Semantics for LLVM IR
16:15 - 16:30
ICFP Research Papers
Both
Q&A: Higher-Order Probabilistic Adversarial Computations: Categorical S ...
16:30 - 16:45
ICFP Research Papers
Mirror
Q&A: How to Evaluate Blame for Gradual Types
16:45 - 17:00
ICFP Research Papers
Mirror
Q&A: ProbNV: Probabilistic Verification of Network Control Planes
17:00 - 17:15
ICFP Research Papers
Main
Q&A: Of JavaScript AOT Compilation Performance
17:15 - 17:30
ICFP Research Papers
Mirror
Q&A: Symbolic and Automatic Differentiation of Languages
17:30 - 17:45
ICFP Research Papers
Both
Q&A: How to design co-programs (JFP Presentation)
19:15 - 19:30
ICFP Research Papers
Both
Q&A: A Theory of Higher-Order Subtyping with Type Intervals
19:30 - 19:45
ICFP Research Papers
Both
Q&A: Typed dataspace actors (JFP Presentation)
19:45 - 20:00
ICFP Research Papers
Both
Q&A: An Existential Crisis Resolved: Type Inference for First-Class Exi ...
20:00 - 20:15
ICFP Research Papers
Both
Q&A: Proof-directed program transformation: A functional account of eff ...
20:15 - 20:30
ICFP Research Papers
Both
Q&A: Distributing Intersection and Union Types with Splits and Duality ...
20:30 - 20:45
ICFP Research Papers
Both
Q&A: Leibniz equality is isomorphic to Martin-Löf identity, parametrica ...
20:45 - 21:00
Wed 25 Aug
Displayed time zone:
Seoul
change
Room
4:00
15
30
45
5:00
15
30
45
6:00
15
30
45
7:00
15
30
45
8:00
15
30
45
9:00
15
30
45
10:00
15
30
45
11:00
15
30
45
12:00
15
30
45
13:00
15
30
45
14:00
15
30
45
15:00
15
30
45
16:00
15
30
45
17:00
15
30
45
18:00
15
30
45
19:00
15
30
45
20:00
15
30
45
ICFP Q&A
ICFP Research Papers
Both
Q&A: Modular, Compositional, and Executable Formal Semantics for LLVM IR
04:15 - 04:30
ICFP Research Papers
Both
Q&A: Higher-Order Probabilistic Adversarial Computations: Categorical S ...
04:30 - 04:45
ICFP Research Papers
Mirror
Q&A: How to Evaluate Blame for Gradual Types
04:45 - 05:00
ICFP Research Papers
Mirror
Q&A: ProbNV: Probabilistic Verification of Network Control Planes
05:00 - 05:15
ICFP Research Papers
Main
Q&A: Of JavaScript AOT Compilation Performance
05:15 - 05:30
ICFP Research Papers
Mirror
Q&A: Symbolic and Automatic Differentiation of Languages
05:30 - 05:45
ICFP Research Papers
Both
Q&A: How to design co-programs (JFP Presentation)
07:15 - 07:30
ICFP Research Papers
Both
Q&A: A Theory of Higher-Order Subtyping with Type Intervals
07:30 - 07:45
ICFP Research Papers
Both
Q&A: Typed dataspace actors (JFP Presentation)
07:45 - 08:00
ICFP Research Papers
Both
Q&A: An Existential Crisis Resolved: Type Inference for First-Class Exi ...
08:00 - 08:15
ICFP Research Papers
Both
Q&A: Proof-directed program transformation: A functional account of eff ...
08:15 - 08:30
ICFP Research Papers
Both
Q&A: Distributing Intersection and Union Types with Splits and Duality ...
08:30 - 08:45
ICFP Research Papers
Both
Q&A: Leibniz equality is isomorphic to Martin-Löf identity, parametrica ...
08:45 - 09:00
ICFP Research Papers
Both
Q&A: On Continuation-Passing Transformations and Expected Cost Analysis
16:15 - 16:30
ICFP Research Papers
Both
Q&A: Steel: Proof-Oriented Programming in a Dependently Typed Concurren ...
16:30 - 16:45
ICFP Research Papers
Mirror
Q&A: Automatic Amortized Resource Analysis with the Quantum Physicist‚Ä ...
16:45 - 17:00
ICFP Research Papers
Both
Q&A: Theorems for Free from Separation Logic Specifications
17:00 - 17:15
ICFP Research Papers
Both
Q&A: Reasoning about the Garden of Forking Paths
17:15 - 17:30
ICFP Research Papers
Both
Q&A: Formal Verification of a Concurrent Bounded Queue in a Weak Memory ...
17:30 - 17:45
ICFP Research Papers
Mirror
Q&A: Newly-Single and Loving It: Improving Higher-Order Must-Alias Anal ...
19:15 - 19:30
ICFP Research Papers
Mirror
Q&A: Grafs: Declarative Graph Analytics
19:30 - 19:45
ICFP Research Papers
Both
Q&A: Certifying the Synthesis of Heap-Manipulating Programs
19:45 - 20:00
ICFP Research Papers
Both
Q&A: Skipping the Binder Bureaucracy with Mixed Embeddings in a Semanti ...
20:00 - 20:15
ICFP Research Papers
Both
Q&A: GhostCell: Separating Permissions from Data in Rust
20:15 - 20:30
ICFP Research Papers
Both
Q&A: Catala: A Programming Language for the Law
20:30 - 20:45
ICFP Research Papers
Main
Q&A: Persistent Software Transactional Memory in Haskell
20:45 - 21:00
Thu 26 Aug
Displayed time zone:
Seoul
change
Room
4:00
15
30
45
5:00
15
30
45
6:00
15
30
45
7:00
15
30
45
8:00
15
30
45
ICFP Q&A
ICFP Research Papers
Both
Q&A: On Continuation-Passing Transformations and Expected Cost Analysis
04:15 - 04:30
ICFP Research Papers
Both
Q&A: Steel: Proof-Oriented Programming in a Dependently Typed Concurren ...
04:30 - 04:45
ICFP Research Papers
Mirror
Q&A: Automatic Amortized Resource Analysis with the Quantum Physicist‚Ä ...
04:45 - 05:00
ICFP Research Papers
Both
Q&A: Theorems for Free from Separation Logic Specifications
05:00 - 05:15
ICFP Research Papers
Both
Q&A: Reasoning about the Garden of Forking Paths
05:15 - 05:30
ICFP Research Papers
Both
Q&A: Formal Verification of a Concurrent Bounded Queue in a Weak Memory ...
05:30 - 05:45
ICFP Research Papers
Mirror
Q&A: Newly-Single and Loving It: Improving Higher-Order Must-Alias Anal ...
07:15 - 07:30
ICFP Research Papers
Mirror
Q&A: Grafs: Declarative Graph Analytics
07:30 - 07:45
ICFP Research Papers
Both
Q&A: Certifying the Synthesis of Heap-Manipulating Programs
07:45 - 08:00
ICFP Research Papers
Both
Q&A: Skipping the Binder Bureaucracy with Mixed Embeddings in a Semanti ...
08:00 - 08:15
ICFP Research Papers
Both
Q&A: GhostCell: Separating Permissions from Data in Rust
08:15 - 08:30
ICFP Research Papers
Both
Q&A: Catala: A Programming Language for the Law
08:30 - 08:45
ICFP Research Papers
Main
Q&A: Persistent Software Transactional Memory in Haskell
08:45 - 09:00
x
Thu 21 Nov 10:12