Author of the publication

Terminating constraint set satisfiability and simplification algorithms for context-dependent overloading.

, , and . J. Braz. Comput. Soc., 19 (4): 423-432 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Type inference for GADTs, outsidein and anti-unification., , and . SBLP, page 51-58. ACM, (2018)A Mechanized Textbook Proof of a Type Unification Algorithm., and . SBMF, volume 9526 of Lecture Notes in Computer Science, page 127-141. Springer, (2015)Certified Bit-Coded Regular Expression Parsing., and . SBLP, page 4:1-4:8. ACM, (2017)Terminating constraint set satisfiability and simplification algorithms for context-dependent overloading., , and . J. Braz. Comput. Soc., 19 (4): 423-432 (2013)Inference of static semantics for incomplete C programs., , , and . Proc. ACM Program. Lang., 2 (POPL): 29:1-29:28 (2018)An attribute language definition for adaptable parsing expression grammars., , , , , and . SAC, page 1518-1525. ACM, (2019)A Type-Directed Algorithm to Generate Well-Typed Featherweight Java Programs., , and . SBMF, volume 11254 of Lecture Notes in Computer Science, page 39-55. Springer, (2018)Certified Derivative-Based Parsing of Regular Expressions., , and . SBLP, volume 9889 of Lecture Notes in Computer Science, page 95-109. Springer, (2016)Property-based testing for lambda expressions semantics in featherweight Java., , and . SBLP, page 43-50. ACM, (2018)Ambiguity and context-dependent overloading., and . J. Braz. Comput. Soc., 19 (3): 313-324 (2013)