Sciweavers

636 search results - page 41 / 128
» Operational Semantics for Functional Logic Languages
Sort
View
234
Voted
POPL
2007
ACM
16 years 4 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
IFIP
2009
Springer
15 years 10 months ago
Static Detection of Logic Flaws in Service-Oriented Applications
Application or business logic, used in the development of services, has to do with the operations that define the application functionalities and not with the platform ones. Often...
Chiara Bodei, Linda Brodo, Roberto Bruni
220
Voted
ENTCS
2007
114views more  ENTCS 2007»
15 years 3 months ago
Reporting Failures in Functional Logic Programs
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
Michael Hanus
143
Voted
CORR
2002
Springer
133views Education» more  CORR 2002»
15 years 3 months ago
Complete Axiomatizations for Reasoning About Knowledge and Time
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various ...
Joseph Y. Halpern, Ron van der Meyden, Moshe Y. Va...
139
Voted
AGP
1994
IEEE
15 years 7 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...