article · 1992
Inference Systems for Binding Time Analysis
Kirsten Lackner Solberg, Hanne Riis Nielson, Flemming Nielson
Cited by 5Abstract and details only
Abstract
this paper we shall take a logical approach and aim at constructing an algorithm for generating a set of constraints to be solved. In this way we will be able to make full use of substitutions as in ordinary type inference [8] --- this is contrary to other algorithms (e.g. [9]) where extra recursive calls have to be performed. The starting point for our work is the inference system for binding times of the simply typed -calculus as specified in [9]. This is reviewed in Section 2. However, we shall reformulate it in a style motivated by the inference system for linear types given in [13] using the so-called "use" types. This is described in Section 3. We construct an algorithm for binding time analysis from this inference system. This algorithm is O (n
Cite this paper
Solberg, K. L., Nielson, H. R., & Nielson, F. (1992). Inference Systems for Binding Time Analysis.
Solberg, Kirsten Lackner, et al. “Inference Systems for Binding Time Analysis.” 1992, pp. 247–54.
Solberg, Kirsten Lackner, Hanne Riis Nielson, and Flemming Nielson. 1992. “Inference Systems for Binding Time Analysis.”
Solberg, K.L., Nielson, H.R. and Nielson, F. (1992) ‘Inference Systems for Binding Time Analysis’.
@article{solberg1992inference,
title = {{Inference Systems for Binding Time Analysis}},
author = {Solberg, Kirsten Lackner and Nielson, Hanne Riis and Nielson, Flemming},
pages = {247--254},
year = {1992}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Binding is inference
Jakob Hohwy · Oxford University Press eBooks · 2013
Cited by 0
Computational analysis and inference of protein-protein interactions from domain information
守広 林田 · 2005
Cited by 0
Probabilistic Inference of Transcription Factor Binding from Multiple Data Sources
Harri J Lähdesmäki, Alistair G. Rust, Ilya Shmulevich · PLoS ONE · 2008
Cited by 52Open access
The jigsaw puzzle of sequence phenotype inference: Piecing together Shannon entropy, importance sampling, and Empirical Bayes
Z. Shreif, Deborah A. Striegel, Vipul Periwal · Journal of Theoretical Biology · 2015
Cited by 3Open access
Interpretable Prediction of Protein-Ligand Interaction by Convolutional Neural Network
Fan Hu, Jiaxin Jiang, Peng Yin · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · 2019
Cited by 7
Prediction of small molecule binding property of protein domains with Bayesian classifiers based on Markov chains
Alla Bulashevska, Martin Stein, David Jackson et al. · Computational Biology and Chemistry · 2009
Cited by 5
Automated incorporation of pairwise dependency in transcription factor binding site prediction using dinucleotide weight tensors
Saeed Omidi, Mihaela Zavolan, Mikhail V. Pachkov et al. · PLoS Computational Biology · 2017
Cited by 19Open access
Combination of Genetic Programming and Support Vector Machine-Based Prediction of Protein-Peptide Binding Sites With Sequence and Structure-Based Features
Shima Shafiee, Abdolhossein Fathi · 2021
Cited by 5