Sciweavers

1742 search results - page 160 / 349
» An Applicative Module Calculus
Sort
View
93
Voted
FP
1995
110views Formal Methods» more  FP 1995»
15 years 4 months ago
Using Types to Parse Natural Language
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type...
Mark P. Jones, Paul Hudak, Sebastian Shaumyan
CSFW
2010
IEEE
15 years 4 months ago
Formal Verification of Privacy for RFID Systems
RFID tags are being widely employed in a variety of applications, ranging from barcode replacement to electronic passports. Their extensive use, however, in combination with their ...
Mayla Brusò, Konstantinos Chatzikokolakis, ...
132
Voted
BIRTHDAY
2008
Springer
15 years 2 months ago
Session and Union Types for Object Oriented Programming
In network applications it is crucial to have a mechanism to guarantee that communications evolve correctly according to the agreed protocol. Session types offer a method for abstr...
Lorenzo Bettini, Sara Capecchi, Mariangiola Dezani...
KR
2010
Springer
15 years 2 months ago
Integrating Action Calculi and AgentSpeak: Closing the Gap
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
Michael Thielscher
120
Voted
FLAIRS
2006
15 years 2 months ago
Multi-Dimensional Dependency Grammar as Multigraph Description
Extensible Dependency Grammar (XDG) is new, modular grammar formalism for natural language. An XDG analysis is a multi-dimensional dependency graph, where each dimension represent...
Ralph Debusmann, Gert Smolka