6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.PL2017
An Executable Specification of Typing Rules for Extensible Records based on Row Polymorphism
Ki Yung Ahn
Type inference is an application domain that is a natural fit for logic programming (LP). LP systems natively support unification, which serves as a basic building block of typical…
cs.LO2017★ 1 cited
Generating Witness of Non-Bisimilarity for the pi-Calculus
Ki Yung Ahn, Ross Horne, Alwen Tiu
In the logic programming paradigm, it is difficult to develop an elegant solution for generating distinguishing formulae that witness the failure of open-bisimilarity between two p…
cs.LO2017★ 6 cited
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic
Ki Yung Ahn, Ross Horne, Alwen Tiu
Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuit…