Automatic generation of text descriptive comments for code blocks
We propose a framework to automatically generate descriptive comments for source code
blocks. While this problem has been studied by many researchers previously, their methods …
blocks. While this problem has been studied by many researchers previously, their methods …
Implementation-independent function reuse
Functions are essential building blocks of information retrieval and information
management. However, efforts implementing these functions are fragmented: one function …
management. However, efforts implementing these functions are fragmented: one function …
Semantic code browsing
Programmers currently enjoy access to a very high number of code repositories and libraries
of ever increasing size. The ensuing potential for reuse is however hampered by the fact that …
of ever increasing size. The ensuing potential for reuse is however hampered by the fact that …
Suggesting valid hole fits for typed-holes (experience report)
MP Gissurarson - ACM SIGPLAN Notices, 2018 - dl.acm.org
Type systems allow programmers to communicate a partial specification of their program to
the compiler using types, which can then be used to check that the implementation matches …
the compiler using types, which can then be used to check that the implementation matches …
A user-friendly interface for a lightweight verification system
User-friendly interfaces can play an important role in bringing the benefits of a machine-
readable representation of formal arguments to a wider audience. The aartifact system is an …
readable representation of formal arguments to a wider audience. The aartifact system is an …
[PDF][PDF] MagicHaskeller on the Web: Automated programming as a service
S Katayama - Haskell Symposium, 2013 - haskell.org
MagicHaskeller on the Web: Automated Programming as a Service Page 1 MagicHaskeller on the
Web: Automated Programming as a Service [System Demonstration Proposal] Susumu Katayama …
Web: Automated Programming as a Service [System Demonstration Proposal] Susumu Katayama …
Isomorphism of intersection and union types
M Coppo, M Dezani-Ciancaglini, I Margaria… - … Structures in Computer …, 2017 - cambridge.org
This paper gives a complete characterisation of type isomorphism definable by terms of a λ-
calculus with intersection and union types. Unfortunately, when union is considered the …
calculus with intersection and union types. Unfortunately, when union is considered the …
[PDF][PDF] User-friendly Support for Common Concepts in a Lightweight Verifier
A Lapets - 2010 - Citeseer
Abstract Machine verification of formal arguments can only increase our confidence in the
correctness of those arguments, but the costs of employing machine verification still …
correctness of those arguments, but the costs of employing machine verification still …
[PDF][PDF] Enhancing RUSTDOC to allow search by types
Progress in type inference algorithms [4] has led to statically typed languages that are easier
to use and more appealing to programmers. Thanks to their performance compared to …
to use and more appealing to programmers. Thanks to their performance compared to …
Functional programming through deep time: modeling the first complex ecosystems on earth
EG Mitchell - ACM Sigplan Notices, 2011 - dl.acm.org
The ecology of Earth's first large organisms is an unsolved problem in palaeontology. This
experience report discusses the determination of which ecosystems could have been …
experience report discusses the determination of which ecosystems could have been …