Sciweavers

1223 search results - page 176 / 245
» Semantic Visualization and Meaning Computation
Sort
View
ICFP
2002
ACM
15 years 11 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
TGC
2005
Springer
15 years 5 months ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
ENGL
2008
129views more  ENGL 2008»
14 years 12 months ago
The Creation of a Chinese Emotion Ontology Based on HowNet
Full comprehension of language comes about by understanding the meaning and the emotion behind the communication. Understanding the meaning of language is the goal of natural lang...
Jiajun Yan, David B. Bracewell, Fuji Ren, Shingo K...
POPL
2012
ACM
13 years 7 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
WCFLP
2005
ACM
15 years 5 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal