3 papers
cs.PL2020
Infer XPath
Michał J. Gajda, Hai Nguyen Quang, Do Ngoc Khanh +1
We propose reformulation of discovery of data structure within a web page as relations between sets of document nodes. We start by reformulating web page analysis as finding expres…
cs.PL2020
Less Arbitrary waiting time
Michał J. Gajda
Property testing is the cheapest and most precise way of building up a test suite for your program. Especially if the datatypes enjoy nice mathematical laws. But it is also the eas…
cs.PL2020
Towards a more perfect union type
Michał J. Gajda
We present a principled theoretical framework for inferring and checking the union types, and show its work in practice on JSON data structures. The framework poses a union type in…