Constructs & Concepts

Total Page:16

File Type:pdf, Size:1020Kb

Constructs & Concepts Constructs & Concepts Language Design for Flexibility and Reliability Anya Helene Bagge moduleCppSkinhiddenscontext-freestart-symbolsProgramimportsDeclarationsexportssortsTmplClauseClassClausecontext-freesyntaxTmplClauseDecl->Decl cons("TmplDecl") "template""<" TypeParam"," *">"RequiresClause*->TmplClause cons("Template") "requires"Identifier"<" ConceptArgument"," *">"->RequiresClause cons("Requires") "template""<" TypeParam"," *">""type"Identifier->TypeParam cons("TemplateType") ExprDeclarativeSubClause*" ""return"Expr";"" "->Decl cons("DefDecl") "typename"Type->TypePar am prefer,cons("TypeParam") "class"Type->TypeParam prefer,cons("TypeParam") "class"TypeNameTypeParamList?->ClassClause cons("ClassClause") ClassClause->DeclDeclarativemoduleDeclarationsimportsLiteralsConceptsStatementsDataRepresenta{ } { } { tionexp} ortssortsStatDeclarativeExprDeclarativeDec{ } lDeclarativeSubClausecon{ text-freesyntaxSta} tDeclarati{ veSubClau} se*BlockStat->Decl cons("DefDecl"{ ) ExprDeclarativeSubClaus} e*"="Expr";"->Decl cons("DefDecl"){ TypeDeclarativeSub} { Clause*"="}DataRep->Decl cons("DefDec l"){ DeclDeclarativeSubClause*"} "Decl*" "->Decl cons("DefDecl"){ StatDeclarativeSubClause*";"->Decl} cons("NoDefDecl") ExprDeclarativeSubClause*";"->Decl{ } cons("NoDefDecl") TypeDeclarativeSubClause*";"->Decl cons("NoDefDecl") DeclDeclarativeSubClause*";"->Decl cons("NoDefDecl") sortsProcClauseProcNamecontext-freesyntax"procedure"ProcNameProcedureParamList->ProcClause{ cons("ProcClaus} e") ProcClause->StatDeclarativeIdentifier->ProcName"{ = "->ProcName} cons("Assign") sortsFunClauseFunNameconte{ xt-freesyntax"function"TypeFunNameFunctionParamList->FunClause} { } { } cons("FunClause") "define"TypeFunNameF{ unctionParamList->FunClause} cons("FunClause") "define"TypeFunName->FunCl{ } ause cons("FunClause") FunClause->ExprDeclarativeIdentifier->{ } FunNamesortsPredClausePredNamecontext-freesyntax"p{ } redicate"PredNameFunctionParamList->PredClause cons("PredClause") PredClause->ExprD{ eclarativeIdent}ifier->PredNamesortsTypeParamListTypeParamFunctionParamListFunctionParamProcedureParamListProcedureParamPar{ } amModecontext-freesyntax"(" TypeParam"," *")"->TypeParamList cons("Dummy"){ "(" FunctionParam","} *")"->FunctionParamList cons("Dummy"){ "(" ProcedureParam","} *")"->ProcedureParamList{ cons("Dummy") Type->TypeParam} cons("TypeExprParam") TypeIdentifier->TypeParam cons("TypeExprParam") "type"->TypeParam cons("AnonTypeParam") "type"Identifi{er->TypeParam cons("} TypeParam") "type"TypeParamList->TypeParam cons("AnonTypePParam") "type"IdentifierTypeParamList->TypeParam cons("TypePParam") TypeIden tifier->FunctionParam cons("Param"){ Type->FunctionParam} cons("AnonParam"){ ParamModeTypeIdentifier->Proc} { } edureParam prefer,cons("Param"){ } TypeIdentifier->ProcedureParam{ } cons("ObsParam"){ ParamModeTyp} e->ProcedureParam{ prefer,cons("AnonPa} ram") "type"Type->ProcedureParam{ cons("TypeOpParam")} "type"Type->{FunctionParam cons("TypeOpParam")} "obs"->ParamMode{ cons("Obs") "upd"->Param} Mode cons("Upd") "out"->ParamMode{ cons("Out") "exp"->ParamMode} cons("Exp") "giv"->ParamMod{ e cons("Giv") "del"->ParamM} ode cons("Del") "nrm"->ParamMode{ cons("Nrm")} sortsAttrClauseAttributecontext-freesyntax"["{ } Attribute"," *"]"->AttrClause{ cons("Attrs") AttrClause->SubClauseIdentifier->Attrib} { ute cons("Attr")} Identifier"(" Expr"," *")"->Att{ ribute cons("Attr}") sortsAlertClauseAlertNamecontext-freesyntax"guard"Expr->{ } AlertClause cons("G{ uard") "guard""} by"Expr->AlertCl{ause prefer,cons("Gua} rd") "alert"{ AlertName"i} f"Expr->AlertClause{ cons("AlertIf")} "alert"AlertName"unless"Expr{ } ->AlertCl{ ause cons("AlertUnless")} "success""if"Expr->AlertClause{ } cons("SuccessIf"){ } "success""unless"Expr->AlertClause cons("SuccessUnless"){ } "fail""if"Expr->AlertClause{ } cons("FailIf") "fail""unless"Expr->AlertCla{ use cons("FailUnle} ss") Identifier->AlertName{ } AlertCla{ use->SubCl}ausesortsForAllClausecontext-freesyntax"forall" TypeParam"," +->ForA{llClause cons("} ForAll") ForAllClause->SubClausesortsVarCla{ useVarN} amecontext-freesyntax"var"TypeVarName->VarClause{ cons("VarClause")} VarClause->ExprDeclarativeIdentif{ ier->VarNamesort sTypeNameTypeClauseClassClausecontext-freesyntax"type"TypeNameTypeParamList?->TypeClause} { } { cons("TypeClause")} Identifier->TypeNameTypeClause->TypeDeclarative"opens""("{ } Identifier"," {*")"->SubClause cons} ("Opens") "default""(" Identifier"," *")"->SubClause cons("Default") moduledesugarimports{ Magnoliamagn} olia/commonsignatures{ ortsPosAnnotatio} nconstructorsarea:Int*Int*Int*Int*Int*Int->Annotationarea-in-file:String*Pos->AnnotationClass:Name*List(Type)->Sigstrate{ } giesdesugar=magnolia-io(filenam e-option,norm-tree;fix-imports;downup(try(norm0);repeat(preserve-annotation(norm1));try(preserve-annotation(n{ } orm2));strip-anno,try(preserve-annotation(norm-forall+norm-cxx))))ov{ er} ride-tree-handler(s|format)=sfilename-option{ } { =ArgOption(}"-f"+"--filename",where(<set-config>("-f",<id>)),!"-ff|--filenam{ } efSetsourcefilenametof")norm0:SName([n])->nnorm0:SName(n@[ , | ])->QName(n)norm0:RName(n)->QName(n)norm0:TypeTuple(ts)->Type(Tuple(),ts)norm0:PType(n,ps)->Type(n,ps’)where<map(try( MatchExpr( t)->MatchType(t) ))>ps=>ps’norm0:Type(n)->Type(n,[])norm0:TypeExpr(t)->TypeExpr(Unresolved(t))norm1:Name(n)->Name(<opname>n)norm2:AName(n,as)->AName(n,<map( x->Unresolved(x) )>as)norm1:Dummy(d)->dnorm1:IfThen(c,e)->If(c,e,Nop())norm1:PrintLn(es)->Call(Name("println"),[es’’])where<map(!Apply(Name("string"),[<id>]))>es=>es’;<foldr(!Literal(String("")),mkappend)>es’=>es’’norm1:Print(es)->Call(Name("print"),[es’’])where<map(!Apply(Name("string"),[<id>]))>es=>es’;<foldr(!Literal(String("\ ") ),mkappend)>es’=>e\ s’’mkappend:(e,Literal(String("")))->emkappend:(e1,e2)->Apply(Name(" ++ "),[e1,Apply(Name(" ++ "),[Literal(String("")),e2])])where<not(Literal(String("")))>e2norm\ \ 1:BinOp(e1,op,e2)->Apply(Name(<concat-strings>[" ",op," "]),[e1,e2])norm1:In(e1,e2)->Apply(Name(" in "),[e1,e2])norm1:NotIn(e1,e2)->Apply(Name(" notin "),[e1,e2])norm1:PreOp(op,e)->Apply(Name(<concat-strings>[op," "]),[e])norm1:Dec(s)->Int(<string-to-int>s)norm1:Hex(s)->Int(<hex-string-to-int>s)norm1:Oct(s)- >Int(<oct-string-to-int>s)norm1:Bin(s)->Int(<bin-string-to-int>s)norm1:Literal(l)->Literal(l,Unresolved())norm1:Var(v)->Var(v,Unresolved(),Upd())norm1:Index(e,as)->Apply(Name(" [ ]"),[e|as])norm1:Assign()->Name(" = ")norm1:Return()->Return(None())norm2:Struct(t,fs)->Struct(Unresolved(t),fs)norm2:Union(t,f)->Struct(Unresolved(t),f)norm2:LiteralTrue()->Literal(Bool(True()),Unresolved())norm2:LiteralFalse()->Literal(Bool(False()),Unresolved())norm2:ObsParam(t,n)->Param(n,Unresolved(t),Ob s())norm2:AnonParam(t)->Param(Name(" "),Unresolved(t),Obs())norm2:TypeOpParam(t)->Param(Name(" "),Unresolved(t),Typ())norm2:AnonParam(m,t)->Param(Name(" "),Unresolved(t),m)norm2:Param(m,t,n)->Param(n,Unresolved(t),m)norm2:Param(t,n)->Param(n,Unresolved(t),Obs())norm2:TypeExprParam(t,n)->Unresolved(Match(n,t))norm2:TypeExprParam(t)->Unresolved(Match(Name(" "),t))norm2:AnonTypeParam()->Unresolved(Match(Name(" "),Type()))norm2:TypeParam(t)->Unresolved(Match(t,Type()))norm2:AnonTypePParam (ts)->Unresolved(Type(Match(Name(" "),TypeFun(as)),ts))where<map( x->Type() )>ts=>asnorm2:TypePParam(t,ts)->Unresolved(Type(Match(t,TypeFun(as)),ts))where<try(norm1);map( x->Type() )>ts=>asnorm2=Block(filter(not(Nop())))norm2:Requires(n,ts,hp)->Requires(Unresolved(n),ts’,hp)where<map(!Unresolved(<id>))>ts=>ts’norm2:Hide(r)->rnorm2:TypeProtect(t,Some(b))->TypeProtect(Unresolved(t),b)norm2:OpProtect(FunClause(t,n,ps),Some(b))->OpProtect(Unresolved(Fun(n,t,ps)),b)norm2:Where(t1,t2)->Wher e(Unresolved(t1),Unresolved(t2))norm2:Apply(n,e)->Apply(Unresolved(n),e)norm2:Call(n,e)->Call(Unresolved(n),e)norm2:Open(vs,e)->Open(vs’,e)where<map(!Var(<id>,Unresolved(),Obs()))>vs=>vs’\ \ \ \ norm2:Assign(n,e)->Assign(Unresolved(n),e)norm2:FieldAssign(v,n,e)->FieldAssign(Unresolved(v),n,e)norm2:IndexedAssign(v,as,e)->IndexedAssign(Unresolved(v),as,e)norm2:VarDefTI(t,n,e)->Def(n,Var(n,Unresolved(t),Upd()),e,[])norm2:VarDefI(n,e)->Def(n,Var(n,None(),Upd()),e,[])norm2:VarDefT(t,n)->Def(n,Var( n,Unresolved(t),Upd()),None(),[])norm2:ConceptDef(n,ps,Some(bs),bd)->Def(n,Concept(n,ps,bs),bd,[])norm2:ConceptDef(n,ps,None(),bd)->Def(n,Concept(n,ps,[]),bd,[])norm2:AxiomDef(n,ps,bd)->Def(n,Axiom(n,ps,[]),bd,[])norm-forall:def@Def( , , , )->Def(n,sig,bd,[ForAll(ts’)|at])where<collect(MatchType(id))>def=>ts@[ | ];<alltd( MatchType(x)->x )>def=>Def(n,sig,bd,at);<map( MatchType(x)->Unresolved(Match(x,Type())) )>ts=>ts’norm-cxx:TmplDecl(Template(ps,rs),Def(n,sig,bd,at))->Def(n,sig,bd,<c oncat;debug>[[ForAll(<conc>(tts’,ps’))],rs,at])where<collect(TemplateType(id,id))>ps=>tts;<alltd( TemplateType( ,t)->Unresolved(Match(t,Type())) )>ps=>ps’;<map( TemplateType(ts, )->ts );concat>tts=>tts’norm-cxx:Def(n,Class(dn,ps),None(),at)->Def(n,Type(dn,ps),None(),at)norm-cxx:Def(n,Class(dn,ps),bd,at)->Def(n,Type(dn,ps),\ StructRep(bd),a\t)where<is-list>bdnorm2:DefDec\l(dclause,subs,bd)->Def(n,sig,bd’,subs’)where(n,sig):=<norm-decl-clause>dclause;s\ ubs’:=<norm-sub-clauses>subs;<try(Nop() ;!None())>bd=>bd’norm2:NoDefDecl(dclause,subs)->Def(n,sig,None(),subs’)where(n,sig):=<norm-decl-clause>dclause;subs’:=<norm-sub-clauses>subsnorm-decl-clause:FunClause(t,n,ps)->(n,Fun(n,Unresolved(t)\ \ \ \ ,ps))norm-decl-clause:FunClause(t,n)->(n,Fun(n,Unresolved(t),[]))norm-decl-clause:PredClause(n,ps)->(n,Fun(n,Unresolved(Name("bool")),ps))norm-decl-clause:ProcClause(n,ps)->(n,Proc(n,ps))norm-decl-clause:VarClause(t,n)->(n,Var(n,Unresolved(t),Upd()))norm-decl-clause:TypeClause(n,Some(ps))->
Recommended publications
  • PHP Game Programming
    PHP Game Programming Matt Rutledge © 2004 by Premier Press, a division of Course Technology. All rights SVP, Course Professional, Trade, reserved. No part of this book may be reproduced or transmitted in any Reference Group: form or by any means, electronic or mechanical, including photocopy- Andy Shafran ing, recording, or by any information storage or retrieval system with- Publisher: out written permission from Course PTR, except for the inclusion of Stacy L. Hiquet brief quotations in a review. Senior Marketing Manager: The Premier Press logo and related trade dress are trademarks of Premier Sarah O’Donnell Press and may not be used without written permission. Marketing Manager: Paint Shop Pro 8 is a registered trademark of Jasc Software. Heather Hurley PHP Coder is a trademark of phpIDE. Series Editor: All other trademarks are the property of their respective owners. André LaMothe Important: Course PTR cannot provide software support. Please contact Manager of Editorial Services: the appropriate software manufacturer’s technical support line or Web Heather Talbot site for assistance. Senior Acquisitions Editor: Course PTR and the author have attempted throughout this book to Emi Smith distinguish proprietary trademarks from descriptive terms by following Associate Marketing Manager: the capitalization style used by the manufacturer. Kristin Eisenzopf Information contained in this book has been obtained by Course PTR Project Editor and Copy Editor: from sources believed to be reliable. However, because of the possibility Dan Foster, Scribe Tribe of human or mechanical error by our sources, Course PTR, or others, the Publisher does not guarantee the accuracy, adequacy, or complete- Technical Reviewer: ness of any information and is not responsible for any errors or omis- John Freitas sions or the results obtained from use of such information.
    [Show full text]
  • Vysoke´Ucˇenítechnicke´V Brneˇ Srovna´Níknihoven
    VYSOKE´ UCˇ ENI´ TECHNICKE´ V BRNEˇ BRNO UNIVERSITY OF TECHNOLOGY FAKULTA INFORMACˇ NI´CH TECHNOLOGII´ U´ STAV POCˇ ´ITACˇ OVE´ GRAFIKY A MULTIME´ DII´ FACULTY OF INFORMATION TECHNOLOGY DEPARTMENT OF COMPUTER GRAPHICS AND MULTIMEDIA SROVNA´ NI´ KNIHOVEN PRO PRA´ CI S OBRAZEM COMPARISON OF IMAGE PROCESSING LIBRARIES BAKALA´ Rˇ SKA´ PRA´ CE BACHELOR’S THESIS AUTOR PRA´ CE LENKA KRU´ POVA´ AUTHOR VEDOUCI´ PRA´ CE Ing. DAVID BARˇ INA SUPERVISOR BRNO 2012 Abstrakt Tato bakala´rˇska´pra´ce se zaby´va´porovna´nı´m knihoven pracujı´cı´ch s obrazem. V pra´ci je mozˇne´ sezna´mit se s teoreticky´m u´vodem z oblasti zpracova´nı´obrazu. Pra´ce do hloubky rozebı´ra´knihovny OpenCV, GD, GIL, ImageMagick, GraphicsMagick, CImg, Imlib2. Zameˇrˇenı´popisu teˇchto kni- hoven se orientuje na rozhranı´v jazycı´ch C a C++. Za´veˇr pra´ce je veˇnova´n porovna´nı´z ru˚zny´ch hledisek. Abstract This bachelor thesis deals with comparison of image processing libraries. This document describes brief introduction into the field of image procesing. There are wide analysis of OpenCV, GD, GIL, ImageMagick, GraphicsMagick, CImg, Imlib2 libraries. The text aims at C and C++ language interfaces of these libraries. The end of the thesis is dedicated to comparison of libaries from various points. Klı´cˇova´slova Zpracova´nı´obrazu, OpenCV, GD, GIL, ImageMagick, GraphicsMagick, CImg, Imlib2 Keywords Image processing, OpenCV, GD, GIL, ImageMagick, GraphicsMagick, CImg, Imlib2 Citace Lenka Kru´pova´: Srovna´nı´knihoven pro pra´ci s obrazem, bakala´rˇska´pra´ce, Brno, FIT VUT v Brneˇ, 2012 Srovna´nı´knihoven pro pra´ci s obrazem Prohla´sˇenı´ Prehlasujem, zˇe som tu´to bakala´rsku pra´cu vypracovala samostatne pod vedenı´m pa´na Ing.
    [Show full text]
  • CGI Programming on the World Wide Web
    CGI Programming on the World Wide Web CGI Programming on the World Wide Web By Shishir Gundavaram; ISBN: 1-56592-168-2, 433 pages. First Edition, March 1996. Table of Contents Preface Chapter 1: The Common Gateway Interface (CGI) Chapter 2: Input to the Common Gateway Interface Chapter 3: Output from the Common Gateway Interface Chapter 4: Forms and CGI Chapter 5: Server Side Includes Chapter 6: Hypermedia Documents Chapter 7: Advanced Form Applications Chapter 8: Multiple Form Interaction Chapter 9: Gateways, Databases, and Search/Index Utilities Chapter 10: Gateways to Internet Information Servers Chapter 11: Advanced and Creative CGI Applications Chapter 12: Debugging and Testing CGI Applications Appendix A: Perl CGI Programming FAQ Appendix B: Summary of Regular Expressions Appendix C: CGI Modules for Perl 5 Appendix D: CGI Lite Appendix E: Applications, Modules, Utilities, and Documentation Index Examples - Warning: this directory includes long filenames which may confuse some older operating systems (notably Windows 3.1). Search the text of CGI Programming on the World Wide Web. http://www.crypto.nc1uw1aoi420d85w1sos.de/documents/oreilly/web/cgi/ (1 of 2) [2/6/2001 11:48:37 PM] CGI Programming on the World Wide Web Copyright © 1996, 1997 O'Reilly & Associates. All Rights Reserved. http://www.crypto.nc1uw1aoi420d85w1sos.de/documents/oreilly/web/cgi/ (2 of 2) [2/6/2001 11:48:37 PM] Preface Preface Preface Contents: What's in the Book What You Are Expected to Know Before Reading Organization of This Book Conventions in This Book Acknowledgments The Common Gateway Interface (CGI) emerged as the first way to present dynamically generated information on the World Wide Web.
    [Show full text]
  • C Programming in Linux
    David Haskins C Programming in Linux 2 Download free eBooks at bookboon.com C Programming in Linux 2nd edition © 2013 David Haskins & bookboon.com ISBN 978-87-403-0543-2 3 Download free eBooks at bookboon.com C Programming in Linux Contents Contents About the author, David Haskins 7 Introduction 9 Setting up your System 12 1 Hello World 14 1.1 Hello Program 1 14 1.2 Hello Program 2 15 1.3 Hello Program 3 18 1.4 Hello Program 4 20 1.5 Hello World conclusion 23 2 Data and Memory 24 2.1 Simple data types? 24 2.2 What is a string? 28 �e Graduate Programme I joined MITAS because for Engineers and Geoscientists I wanted real responsibili� www.discovermitas.comMaersk.com/Mitas �e Graduate Programme I joined MITAS because for Engineers and Geoscientists I wanted real responsibili� Maersk.com/Mitas Month 16 I wwasas a construction Month 16 supervisorI wwasas in a construction the North Sea supervisor in advising and the North Sea Real work helpinghe foremen advising and IInternationalnternationaal opportunities ��reeree wworkoro placements solves Real work problems helpinghe foremen IInternationalnternationaal opportunities ��reeree wworkoro placements solves problems 4 Click on the ad to read more Download free eBooks at bookboon.com C Programming in Linux Contents 2.3 What can a string “mean” 29 2.4 Parsing a string 32 2.5 Data and Memory – conclusion 34 3 Functions, pointers and structures 36 3.1 Functions 36 3.2 Library Functions 38 3.3 A short library function reference 39 3.4 Data Structures 41 3.5 Functions, pointers and structures – conclusion
    [Show full text]
  • Opensolaris Presentation
    Open source for the enterprise Marco Colombo Sun Microsystems Italia S.p.A. What is Open Source? Distribute binaries + source code Open Source and/or Free software license Freely: modifiable, redistributable, forkable Non-discriminatory Consensus driven projects Meritocracy Peer review and public discussion OK to make money - but not for access to code 2 OpenSolaris: Open Source for the Enterprise | Marco Colombo – Sun Microsystems Italia Why Open Source? Good For Customers Good For Sun & Partners Community drives choice, Innovation happens competition, value everywhere Accelerates unexpected, Creates new opportunities by disruptive innovation growing the market 3 OpenSolaris: Open Source for the Enterprise | Marco Colombo – Sun Microsystems Italia Community Participation 4 CopyrightOpenSolaris: © 2004 SomersetOpen Source Historical for Centerthe Enterprise | Marco Colombo – Sun Microsystems Italia Sun: A History of Community J2EE, J2ME NFS Jini UNIX SVR4 XML Sun 1 with TCP/IP 1980 1990 2000 2005 5 OpenSolaris: Open Source for the Enterprise | Marco Colombo – Sun Microsystems Italia Benefit Of Open Communities Shared vision, goals Access to Technology Open Agreed sharing and Ideas Development (license) Agreed relationships Open Communities (governance) Committed members Broad Inclusive Participation Process It’s About Both People and Technologies 6 OpenSolaris: Open Source for the Enterprise | Marco Colombo – Sun Microsystems Italia Expect the Unexpected Bright, well-known people contribute code regularly Community finds new uses Jini™
    [Show full text]
  • Introgression Library Visualization and Query Tool Christopher a Bottoms1*, Sherry Flint-Garcia1,2, Michael D Mcmullen1,2 from Seventh Annual MCBIOS Conference
    Bottoms et al. BMC Bioinformatics 2010, 11(Suppl 6):S28 http://www.biomedcentral.com/1471-2105/11/S6/S28 PROCEEDINGS Open Access IView: introgression library visualization and query tool Christopher A Bottoms1*, Sherry Flint-Garcia1,2, Michael D McMullen1,2 From Seventh Annual MCBIOS Conference. Bioinformatics: Systems, Biology, Informatics and Computation Jonesboro, AR, USA. 19-20 February 2010 Abstract Background: An introgression library is a family of near-isogenic lines in a common genetic background, each of which carries one or more genomic regions contributed by a donor genome. Near-isogenic lines are powerful genetic resources for the analysis of phenotypic variation and are important for map-base cloning genes underlying mutations and traits. With many thousands of distinct genotypes, querying introgression libraries for lines of interest is an issue. Results: We have created IView, a tool to graphically display and query near-isogenic line libraries for specific introgressions. This tool incorporates a web interface for displaying the location and extent of introgressions. Each genetic marker is associated with a position on a reference map. Users can search for introgressions using marker names, or chromosome number and map positions. This search results in a display of lines carrying an introgression at the specified position. Upon selecting one of the lines, color-coded introgressions on all chromosomes of the line are displayed graphically. The source code for IView can be downloaded from http://xrl.us/iview. Conclusions: IView will be useful for those wanting to make introgression data from their stock of germplasm searchable. Background Introgression libraries are useful for testing the pheno- Near isogenic lines (NILs) are lines derived from a parti- typic effects of donor introgressions and as the starting cular parental line (i.e.
    [Show full text]
  • Enabling Webpages with Active Content Using Tcl
    The following paper was originally published in the Proceedings of the Sixth Annual Tcl/Tk Workshop San Diego, California, September 14–18, 1998 NeoWebScript: Enabling Webpages with Active Content Using Tcl Karl Lehenbauer NeoSoft, Inc. For more information about USENIX Association contact: 1. Phone: 510 528-8649 2. FAX: 510 548-5738 3. Email: [email protected] 4. WWW URL:http://www.usenix.org/ NeoWebScript: Enabling Webpages with Active Content Using Tcl Karl Lehenbauer NeoSoft, Inc. [email protected] Abstract applications. Customers use every platform and devel- opment tool, and every web publishing technique has NeoWebScript marries the world’s most popular web- limitations that affect how the developer interfaces server, Apache, with the Tcl programming language to with specific server-side capabilities. While much create a secure, efficient, server-side scripting lan- attention has been given to Java and JavaScript for guage that gives webpage developers simple-yet- client-side scripting, many forms of active content powerful tools for creating and serving webpages with require that data be maintained, accessed and updated active content. on the server. Such applications include electronic commerce, shared databases… even simple things like The ability to embed NeoWebScript code into existing hit counters. webpages, without requiring a URL name change, leverages work done with webpage creation tools such As our customers became more sophisticated and as Netscape Communicator and Net Objects Fusion, creative, they began asking for active content features while not disturbing links from remote sites and search such as access counters and rotating banner ads. Many engines. had CGI scripts that they had written, or obtained, and wanted to run them on our webserver.
    [Show full text]
  • All Installed Packages .PDF
    Emperor-OS All Installed Package Editor: Hussein Seilany [email protected] www.Emperor-OS.com Emperor-has 5 package management system for installing, upgrading, configuring, and removing software. Also providing access over 60,000 software packages of Ubuntu. We per-installed several tools are available for interacting with Emperor's package management system. You can use simple command-line utilities to a graphical tools. Emperor-OS's package management system is derived from the same system used by the Ubuntu GNU/Linux distribution. We will show you the list of installed packages on Emperor-OS. The packages lists is long. Having a list of installed packages helps system administrators maintain, replicate, and reinstall Emperor-OS systems. Emperor-OS Linux systems install dependencies all the time, hence it is essential to know what is on the system. In this page you can find a specific package and python modules is installed, count installed packages and find out the version of an installed package. Download lists as PDF file or see them as html page in the following: Are you looking for all in one operating system? 70 Packages: Installed Special Packages 120 Tools: Installed Utility 260 Modules: Installed Python2 and 3 Modules 600Fonts: Installed Fonts 5 Desktops: Desktop Manager Packages 22Tools: Extra Development Tools 270 Themes: Installed Themes 40 Icons: Installed Icons 40Games: Installed Games 2533scanners: supports Scanners 2500 Cameras: supports Camera 4338Packages: All Installed Packages 2 [email protected] www.Emperor-OS.com The list installed packages: Emperor-OS Linux is an open source operating system with many utilities.
    [Show full text]
  • O'reilly CGI Programming.Pdf
    CGI Programming on the World Wide Web By Shishir Gundavaram; ISBN: 1-56592-168-2, 433 pages. First Edition, March 1996. Table of Contents Preface Chapter 1: The Common Gateway Interface (CGI) Chapter 2: Input to the Common Gateway Interface Chapter 3: Output from the Common Gateway Interface Chapter 4: Forms and CGI Chapter 5: Server Side Includes Chapter 6: Hypermedia Documents Chapter 7: Advanced Form Applications Chapter 8: Multiple Form Interaction Chapter 9: Gateways, Databases, and Search/Index Utilities Chapter 10: Gateways to Internet Information Servers Chapter 11: Advanced and Creative CGI Applications Chapter 12: Debugging and Testing CGI Applications Appendix A: Perl CGI Programming FAQ Appendix B: Summary of Regular Expressions Appendix C: CGI Modules for Perl 5 Appendix D: CGI Lite Appendix E: Applications, Modules, Utilities, and Documentation Index Examples - Warning: this directory includes long filenames which may confuse some older operating systems (notably Windows 3.1). Search the text of CGI Programming on the World Wide Web. Copyright © 1996, 1997 O'Reilly & Associates. All Rights Reserved. Chapter 1 1. The Common Gateway Interface (CGI) Contents: What Is CGI? CGI Applications Some Working CGI Applications Internal Workings of CGI Configuring the Server Programming in CGI CGI Considerations Overview of the Book 1.1 What Is CGI? As you traverse the vast frontier of the World Wide Web, you will come across documents that make you wonder, "How did they do this?" These documents could consist of, among other things, forms that ask for feedback or registration information, imagemaps that allow you to click on various parts of the image, counters that display the number of users that accessed the document, and utilities that allow you to search databases for particular information.
    [Show full text]
  • Kurt Hornik I
    R FAQ Frequently Asked Questions on R Version 2.6.2007-10-22 ISBN 3-900051-08-9 Kurt Hornik i Table of Contents 1 Introduction............................... 1 1.1 Legalese .................................................... 1 1.2 Obtaining this document..................................... 1 1.3 Citing this document ........................................ 1 1.4 Notation.................................................... 1 1.5 Feedback ................................................... 2 2 R Basics .................................. 3 2.1 What is R? ................................................. 3 2.2 What machines does R run on?............................... 3 2.3 What is the current version of R?............................. 4 2.4 How can R be obtained? ..................................... 4 2.5 How can R be installed? ..................................... 4 2.5.1 How can R be installed (Unix) ........................... 4 2.5.2 How can R be installed (Windows) ....................... 5 2.5.3 How can R be installed (Macintosh) ...................... 5 2.6 Are there Unix binaries for R? ............................... 6 2.7 What documentation exists for R? ............................ 6 2.8 Citing R .................................................... 8 2.9 What mailing lists exist for R? ............................... 9 2.10 What is CRAN? ........................................... 10 2.11 Can I use R for commercial purposes? ...................... 10 2.12 Why is R named R? ....................................... 11 2.13 What
    [Show full text]
  • Version : 2009K Vendor: Centos Release : 1.El5 Build Date
    Name : tzdata Relocations: (not relocatable) Version : 2009k Vendor: CentOS Release : 1.el5 Build Date: Mon 17 Aug 2009 06:43:09 PM EDT Install Date: Mon 19 Dec 2011 12:32:58 PM EST Build Host: builder16.centos.org Group : System Environment/Base Source RPM: tzdata-2009k- 1.el5.src.rpm Size : 1855860 License: GPL Signature : DSA/SHA1, Mon 17 Aug 2009 06:48:07 PM EDT, Key ID a8a447dce8562897 Summary : Timezone data Description : This package contains data files with rules for various timezones around the world. Name : nash Relocations: (not relocatable) Version : 5.1.19.6 Vendor: CentOS Release : 54 Build Date: Thu 03 Sep 2009 07:58:31 PM EDT Install Date: Mon 19 Dec 2011 12:33:05 PM EST Build Host: builder16.centos.org Group : System Environment/Base Source RPM: mkinitrd-5.1.19.6- 54.src.rpm Size : 2400549 License: GPL Signature : DSA/SHA1, Sat 19 Sep 2009 11:53:57 PM EDT, Key ID a8a447dce8562897 Summary : nash shell Description : nash shell used by initrd Name : kudzu-devel Relocations: (not relocatable) Version : 1.2.57.1.21 Vendor: CentOS Release : 1.el5.centos Build Date: Thu 22 Jan 2009 05:36:39 AM EST Install Date: Mon 19 Dec 2011 12:33:06 PM EST Build Host: builder10.centos.org Group : Development/Libraries Source RPM: kudzu-1.2.57.1.21- 1.el5.centos.src.rpm Size : 268256 License: GPL Signature : DSA/SHA1, Sun 08 Mar 2009 09:46:41 PM EDT, Key ID a8a447dce8562897 URL : http://fedora.redhat.com/projects/additional-projects/kudzu/ Summary : Development files needed for hardware probing using kudzu.
    [Show full text]
  • Kurt Hornik I
    R faq Frequently Asked Questions on R Version 2.7.2008-04-18 ISBN 3-900051-08-9 Kurt Hornik i Table of Contents 1 Introduction ............................... 1 1.1 Legalese ................................................ 1 1.2 Obtaining this document................................. 1 1.3 Citing this document .................................... 1 1.4 Notation................................................ 1 1.5 Feedback ............................................... 2 2 R Basics .................................. 3 2.1 What is R? ............................................. 3 2.2 What machines does R run on?........................... 3 2.3 What is the current version of R?......................... 4 2.4 How can R be obtained? ................................. 4 2.5 How can R be installed? ................................. 4 2.5.1 How can R be installed (Unix) ................... 4 2.5.2 How can R be installed (Windows) ............... 5 2.5.3 How can R be installed (Macintosh).............. 5 2.6 Are there Unix binaries for R? ........................... 6 2.7 What documentation exists for R? ........................ 7 2.8 Citing R................................................ 8 2.9 What mailing lists exist for R? ........................... 9 2.10 What is cran? ....................................... 10 2.11 Can I use R for commercial purposes? .................. 11 2.12 Why is R named R? ................................... 11 2.13 What is the R Foundation? ............................ 11 3 R and S .................................
    [Show full text]