Sciweavers

3658 search results - page 665 / 732
» The logic of proofs, semantically
Sort
View
POPL
2007
ACM
14 years 8 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
POPL
2006
ACM
14 years 8 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
POPL
2005
ACM
14 years 8 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna
ATVA
2005
Springer
202views Hardware» more  ATVA 2005»
14 years 1 months ago
Model Checking Real Time Java Using Java PathFinder
Abstract. The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real t...
Gary Lindstrom, Peter C. Mehlitz, Willem Visser
KES
2004
Springer
14 years 1 months ago
Commonsense Reasoning in and Over Natural Language
ConceptNet is a very large semantic network of commonsense knowledge suitable for making various kinds of practical inferences over text. ConceptNet captures a wide range of common...
Hugo Liu, Push Singh