Sciweavers

645 search results - page 3 / 129
» Pure patterns type systems
Sort
View
POPL
2008
ACM
14 years 5 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
ICFP
2010
ACM
13 years 6 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
IJBC
2007
77views more  IJBC 2007»
13 years 5 months ago
Stability Computations for Nilpotent Hopf bifurcations in Coupled Cell Systems
Vanderbauwhede and van Gils, Krupa, and Langford studied unfoldings of bifurcations with purely imaginary eigenvalues and a nonsemisimple linearization, which generically occurs i...
M. Golubitsky, M. Krupa
CADE
2001
Springer
14 years 5 months ago
Canonical Propositional Gentzen-Type Systems
Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the subformula property, in...
Arnon Avron, Iddo Lev
TREC
2007
13 years 6 months ago
IITD-IBMIRL System for Question Answering Using Pattern Matching, Semantic Type and Semantic Category Recognition
A Question Answering (QA) system aims to return exact answers to natural language questions. While today information retrieval techniques are quite successful at locating within l...
Ashish Kumar Saxena, Ganesh Viswanath Sambhu, Saro...