SPLASH 2020
Sun 15 - Sat 21 November 2020 Online Conference
Mon 16 Nov 2020 10:20 - 11:00 at SPLASH-VII - Posters Session 2
Mon 16 Nov 2020 22:20 - 23:00 at SPLASH-VII - Posters Session 2 Mirror

The Amber rules are well-known and widely used for subtyping iso-recursive types. They were first briefly and informally introduced in 1985 by Cardelli in a manuscript describing the Amber language. Despite their use over many years, important aspects of the metatheory of the iso-recursive style Amber rules have not been studied in depth or turn out to be quite challenging to formalize. This paper aims to revisit the problem of subtyping iso-recursive types. We start by introducing a novel declarative specification that we believe captures the “spirit” of Amber-style iso-recursive subtyping. Informally, the specification states that two recursive types are subtypes \emph{if all their finite unfoldings are subtypes}. The Amber rules are shown to be sound with respect to this declarative specification. We then derive a \emph{sound}, \emph{complete} and \emph{decidable} algorithmic formulation of subtyping that employs a novel \emph{double unfolding} rule. Compared to the Amber rules, the double unfolding rule has the advantage of: 1) \emph{being modular}; 2) \emph{not requiring reflexivity} to be built in; and 3) leading to an \emph{easy proof of transitivity of subtyping}. This work sheds new insights on the theory of subtyping iso-recursive types, and the new double unfolding rule has important advantages over the original Amber rules for both implementations and metatheoretical studies involving recursive types. All results are mechanically formalized in the Coq theorem prover. Furthermore, as far as we know, this is the first comprehensive treatment of iso-recursive subtyping in a theorem prover, which can deal with \emph{unrestricted} recursive types.

Conference Day
Mon 16 Nov

Displayed time zone: Central Time (US & Canada) change

10:20 - 11:00
Posters Session 2Posters at SPLASH-VII +12h
10:20
40m
Poster
Resolution as Intersection Subtyping via Modus PonensOOPSLA
Posters
Koar MarntirosianKU Leuven, Tom SchrijversKU Leuven, Bruno C. d. S. OliveiraUniversity of Hong Kong, Georgios KarachaliasTweag
10:20
40m
Poster
Macros For Domain-Specific LanguagesOOPSLA
Posters
Michael BallantyneNortheastern University, Alexis KingNorthwestern University, Matthias FelleisenNortheastern University
10:20
40m
Poster
Precise Inference of Expressive Units of Measurement TypesOOPSLA
Posters
Tongtong XiangUniversity of Waterloo, Jeff Y. LuoUniversity of Waterloo, Werner DietlUniversity of Waterloo
10:20
40m
Poster
Guiding Dynamic Programing via Structural Probability for Accelerating Programming by ExampleOOPSLA
Posters
Ruyi JiPeking University, Yican SunPeking University, Yingfei XiongPeking University, Zhenjiang HuPeking University
10:20
40m
Poster
A Sparse Iteration Space Transformation Framework for Sparse Tensor AlgebraOOPSLA
Posters
Ryan SenanayakeReservoir Labs, Changwan HongMassachusetts Institute of Technology, Ziheng WangMassachusetts Institute of Technology, Amalee WilsonStanford University, Stephen ChouMassachusetts Institute of Technology, Shoaib KamilAdobe Research, Saman AmarasingheMassachusetts Institute of Technology, Fredrik KjolstadStanford University
DOI Pre-print Media Attached File Attached
10:20
40m
Poster
Learning Semantic Program Embeddings with Graph Interval Neural NetworkOOPSLA
Posters
Yu WangNanjing University, China, Ke WangVisa Research, Fengjuan GaoNanjing University, Linzhang WangNanjing University
10:20
40m
Poster
Statically Verified Refinements for Multiparty ProtocolsOOPSLA
Posters
Fangyi ZhouImperial College London, Francisco FerreiraImperial College London, Raymond HuUniversity of Hertfordshire, Rumyana NeykovaBrunel University London, Nobuko YoshidaImperial College London
10:20
40m
Poster
Towards a Formal Foundation of Intermittent ComputingOOPSLA
Posters
Milijana SurbatovichCarnegie Mellon University, Brandon LuciaCarnegie Mellon University, Limin JiaCarnegie Mellon University
10:20
40m
Poster
Incremental Predicate Analysis for Regression VerificationOOPSLA
Posters
Qianshan YuTsinghua University, Fei HeTsinghua University, Bow-Yaw WangAcademia Sinica
10:20
40m
Poster
StreamQL: A Query Language for Processing Streaming Time SeriesOOPSLA
Posters
Lingkun KongRice University, Konstantinos MamourasRice University
10:20
40m
Poster
SATUNE: Synthesizing Efficient SAT EncodersOOPSLA
Posters
Hamed GorjiaraUniversity of California at Irvine, Guoqing Harry XuUniversity of California at Los Angeles, Brian DemskyUniversity of California at Irvine
10:20
40m
Poster
Scaling Exact Inference for Discrete Probabilistic ProgramsOOPSLA
Posters
Steven HoltzenUniversity of California at Los Angeles, Guy Van den BroeckUniversity of California at Los Angeles, Todd MillsteinUniversity of California, Los Angeles
10:20
40m
Poster
Certified and Efficient Instruction SchedulingOOPSLA
Posters
Sylvain BoulméGrenoble Alps University / CNRS / Grenoble INP / VERIMAG, Cyril SixKalray / Grenoble Alps University / CNRS / Grenoble INP / VERIMAG, David MonniauxGrenoble Alps University / CNRS / Grenoble INP / VERIMAG
10:20
40m
Poster
Revisiting Iso-Recursive SubtypingOOPSLA
Posters
Yaoda ZhouUniversity of Hong Kong, Bruno C. d. S. OliveiraUniversity of Hong Kong, Jinxu ZhaoUniversity of Hong Kong
10:20
40m
Poster
Guided Linking: Dynamic Linking Without the CostsOOPSLA
Posters
Sean BartellUniversity of Illinois at Urbana-Champaign, Will DietzUniversity of Illinois at Urbana-Champaign, Vikram S. AdveUniversity of Illinois at Urbana-Champaign
10:20
40m
Poster
Unifying Execution of Imperative Generators and Declarative SpecificationsOOPSLA
Posters
Pengyu NieUniversity of Texas at Austin, Marinela ParovicUniversity of Texas at Austin, Zhiqiang ZangUniversity of Texas at Austin, Sarfraz KhurshidUniversity of Texas at Austin, Aleksandar MilicevicMicrosoft, Milos GligoricUniversity of Texas at Austin
10:20
40m
Poster
CompCertELF: Verified Separate Compilation of C Programs into ELF Object FilesOOPSLA
Posters
Yuting WangShanghai Jiao Tong University, Xiangzhe XuNanjing University, Pierre WilkeCentraleSupélec, Zhong ShaoYale University
22:20 - 23:00
Posters Session 2 MirrorPosters at SPLASH-VII
22:20
40m
Poster
Learning Semantic Program Embeddings with Graph Interval Neural NetworkOOPSLA
Posters
Yu WangNanjing University, China, Ke WangVisa Research, Fengjuan GaoNanjing University, Linzhang WangNanjing University
22:20
40m
Poster
Towards a Formal Foundation of Intermittent ComputingOOPSLA
Posters
Milijana SurbatovichCarnegie Mellon University, Brandon LuciaCarnegie Mellon University, Limin JiaCarnegie Mellon University
22:20
40m
Poster
StreamQL: A Query Language for Processing Streaming Time SeriesOOPSLA
Posters
Lingkun KongRice University, Konstantinos MamourasRice University
22:20
40m
Poster
Incremental Predicate Analysis for Regression VerificationOOPSLA
Posters
Qianshan YuTsinghua University, Fei HeTsinghua University, Bow-Yaw WangAcademia Sinica
22:20
40m
Poster
SATUNE: Synthesizing Efficient SAT EncodersOOPSLA
Posters
Hamed GorjiaraUniversity of California at Irvine, Guoqing Harry XuUniversity of California at Los Angeles, Brian DemskyUniversity of California at Irvine
22:20
40m
Poster
A Sparse Iteration Space Transformation Framework for Sparse Tensor AlgebraOOPSLA
Posters
Ryan SenanayakeReservoir Labs, Changwan HongMassachusetts Institute of Technology, Ziheng WangMassachusetts Institute of Technology, Amalee WilsonStanford University, Stephen ChouMassachusetts Institute of Technology, Shoaib KamilAdobe Research, Saman AmarasingheMassachusetts Institute of Technology, Fredrik KjolstadStanford University
DOI Pre-print Media Attached File Attached
22:20
40m
Poster
Unifying Execution of Imperative Generators and Declarative SpecificationsOOPSLA
Posters
Pengyu NieUniversity of Texas at Austin, Marinela ParovicUniversity of Texas at Austin, Zhiqiang ZangUniversity of Texas at Austin, Sarfraz KhurshidUniversity of Texas at Austin, Aleksandar MilicevicMicrosoft, Milos GligoricUniversity of Texas at Austin
22:20
40m
Poster
Statically Verified Refinements for Multiparty ProtocolsOOPSLA
Posters
Fangyi ZhouImperial College London, Francisco FerreiraImperial College London, Raymond HuUniversity of Hertfordshire, Rumyana NeykovaBrunel University London, Nobuko YoshidaImperial College London
22:20
40m
Poster
Guiding Dynamic Programing via Structural Probability for Accelerating Programming by ExampleOOPSLA
Posters
Ruyi JiPeking University, Yican SunPeking University, Yingfei XiongPeking University, Zhenjiang HuPeking University
22:20
40m
Poster
Revisiting Iso-Recursive SubtypingOOPSLA
Posters
Yaoda ZhouUniversity of Hong Kong, Bruno C. d. S. OliveiraUniversity of Hong Kong, Jinxu ZhaoUniversity of Hong Kong
22:20
40m
Poster
Macros For Domain-Specific LanguagesOOPSLA
Posters
Michael BallantyneNortheastern University, Alexis KingNorthwestern University, Matthias FelleisenNortheastern University
22:20
40m
Poster
CompCertELF: Verified Separate Compilation of C Programs into ELF Object FilesOOPSLA
Posters
Yuting WangShanghai Jiao Tong University, Xiangzhe XuNanjing University, Pierre WilkeCentraleSupélec, Zhong ShaoYale University
22:20
40m
Poster
Certified and Efficient Instruction SchedulingOOPSLA
Posters
Sylvain BoulméGrenoble Alps University / CNRS / Grenoble INP / VERIMAG, Cyril SixKalray / Grenoble Alps University / CNRS / Grenoble INP / VERIMAG, David MonniauxGrenoble Alps University / CNRS / Grenoble INP / VERIMAG
22:20
40m
Poster
Resolution as Intersection Subtyping via Modus PonensOOPSLA
Posters
Koar MarntirosianKU Leuven, Tom SchrijversKU Leuven, Bruno C. d. S. OliveiraUniversity of Hong Kong, Georgios KarachaliasTweag
22:20
40m
Poster
Precise Inference of Expressive Units of Measurement TypesOOPSLA
Posters
Tongtong XiangUniversity of Waterloo, Jeff Y. LuoUniversity of Waterloo, Werner DietlUniversity of Waterloo
22:20
40m
Poster
Guided Linking: Dynamic Linking Without the CostsOOPSLA
Posters
Sean BartellUniversity of Illinois at Urbana-Champaign, Will DietzUniversity of Illinois at Urbana-Champaign, Vikram S. AdveUniversity of Illinois at Urbana-Champaign
22:20
40m
Poster
Scaling Exact Inference for Discrete Probabilistic ProgramsOOPSLA
Posters
Steven HoltzenUniversity of California at Los Angeles, Guy Van den BroeckUniversity of California at Los Angeles, Todd MillsteinUniversity of California, Los Angeles