Sciweavers

272 search results - page 5 / 55
» Programming languages capturing complexity classes
Sort
View
EUROCOLT
1999
Springer
13 years 11 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
ECOOP
2010
Springer
14 years 6 days ago
Automatically Extracting Class Diagrams from Spreadsheets
Abstract. The use of spreadsheets to capture information is widespread in industry. Spreadsheets can thus be a wealthy source of domain information. We propose to automatically ext...
Felienne Hermans, Martin Pinzger, Arie van Deursen
CSL
2009
Springer
13 years 11 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
SAC
2004
ACM
14 years 25 days ago
Adding wildcards to the Java programming language
This paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. Based on the notion of v...
Mads Torgersen, Christian Plesner Hansen, Erik Ern...
ICCL
1994
IEEE
13 years 11 months ago
Semantics for a Real-Time Object-Oriented Programming Language
This paper presents a framework to define a semantics for a real-time object-orientation programming language and to verify programs written in the language. The semantics is defi...
Ichiro Satoh, Mario Tokoro