2 citations · 3 across the 7 of their papers we have counts for
8 papers
Computational philosophy of science
Michał J. Gajda
Philosophy of science attempts to describe all parts of the scientific process in a general way in order to facilitate the description, execution and improvements of this process.…
Data accounting and error counting
Michał J. Gajda
Can we infer sources of errors from outputs of the complex data analytics software? Bidirectional programming promises that we can reverse flow of software, and translate correctio…
Consistent ultrafinitist logic
Michał J. Gajda
Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of inf…
Curious properties of latency distributions
Michał J. Gajda
Network latency distributions, their algebra, and use examples. This paper considers modeling of capacity-insensitive processes and distributed systems. It provides algebraic prope…
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…
Multicloud API binding generation from documentation
Michał J. Gajda, Vitor Vitali Barrozzi, Gabriel Araujo
We present industry experience from implementing retargetable cloud API binding generator. The analysis is implemented in Haskell, using type classes, types a la carte, and code ge…
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…
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…